Sequence Independent Lifting for Mixed-Integer Programming
Operations Research
On the facets of mixed integer programs with two integer variables and two constraints
Mathematical Programming: Series A and B
Minimal Valid Inequalities for Integer Constraints
Mathematics of Operations Research
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Minimal Inequalities for an Infinite Relaxation of Integer Programs
SIAM Journal on Discrete Mathematics
Constrained Infinite Group Relaxations of MIPs
SIAM Journal on Optimization
A counterexample to a conjecture of Gomory and Johnson
Mathematical Programming: Series A and B
Computing with multi-row Gomory cuts
Operations Research Letters
Split Rank of Triangle and Quadrilateral Inequalities
Mathematics of Operations Research
Experiments with two row tableau cuts
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Unique Minimal Liftings for Simplicial Polytopes
Mathematics of Operations Research
Hi-index | 0.00 |
Recently it has been shown that minimal inequalities for a continuous relaxation of mixed-integer linear programs are associated with maximal lattice-free convex sets. In this paper, we show how to lift these inequalities for integral nonbasic variables by considering maximal lattice-free convex sets in a higher dimensional space. We apply this approach to several examples. In particular, we identify cases in which the lifting is unique.