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

Example 3.8: A Simple Integer Program Recall the linear programming problem presented in the "Introduction to Mathematical Programming" chapter. In that problem, a firm produces two products, ...

Two new integer programming normalisations are proposed in this paper. In the first, binary variables are used to represent the constant term, but with this normalisation functions with a zero ...

Nazario D. Ramirez-Beltran, Integer Programming to Minimize Labour Costs, The Journal of the Operational Research Society, Vol. 46, No. 2 (Feb., 1995), pp. 139-146 ...

The following is a simple mixed integer programming problem. Details can be found in Example 3.8 in the "Examples" section.

The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...

The 21st Conference on Integer Programming and Combinatorial Optimization June 8-10, 2020, London, UK.