Integer and combinatorial optimization
Integer and combinatorial optimization
Cutting planes for integer programs with general integer variables
Mathematical Programming: Series A and B - Special issue on computational integer programming
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing
Non-standard approaches to integer programming
Discrete Applied Mathematics
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Sequence Independent Lifting for Mixed-Integer Programming
Operations Research
Designing capacitated survivable networks: polyhedral analysis and algorithms
Designing capacitated survivable networks: polyhedral analysis and algorithms
Lifting two-integer knapsack inequalities
Mathematical Programming: Series A and B
| Hi-index | 0.00 |
We propose an approximate lifting procedure for general integer programs. This lifting procedure uses information from multiple constraints of the problem formulation and can be used to strengthen formulations and cuts for mixed-integer programs. In particular, we demonstrate how it can be applied to improve Gomory's fractional cut, which is central to Glover's primal cutting-plane algorithm. We show that the resulting algorithm is finitely convergent. We also present numerical results that illustrate the computational benefits of the proposed lifting procedure.