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 ...

Integer programming and combinatorial optimization form the backbone of many decision-making and resource allocation problems across diverse fields, from logistics and telecommunications to finance ...

Formulations of mathematical programs often require that some of the decision variables take only integer values. Consider the formulation You can follow the same steps to identify binary variables.

The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO XXI) took place online on June 8-10. The conference was preceded by an online Summer School on June 6-7. The conference ...

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...