Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) ...

Mathematics of Operations Research, Vol. 35, No. 1 (Feb., 2010), pp. 233-256 (24 pages) A maximal lattice free polyhedron L has max-facet-width equal to ω if $\max _{x \in L} \pi ^T x - \min _{x \in L ...

The MS Business Analytics degree focuses on the exciting and fast-growing field of big data. Designed to teach students how to translate data into strategic business decisions, this robust technical ...

In this paper we discuss some branch and bound methods implemented in the UMPIRE mathematical programming system for solving practical integer programming problems and give details of computational ...