Inequalities from Two Rows of a Simplex Tableau
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
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
Mixed-integer sets from two rows of two adjacent simplex bases
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
Minimal Inequalities for an Infinite Relaxation of Integer Programs
SIAM Journal on Discrete Mathematics
On degenerate multi-row Gomory cuts
Operations Research Letters
A Geometric Perspective on Lifting
Operations Research
Split Rank of Triangle and Quadrilateral Inequalities
Mathematics of Operations Research
On Maximal $S$-Free Convex Sets
SIAM Journal on Discrete Mathematics
Strengthening lattice-free cuts using non-negativity
Discrete Optimization
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to this stronger relaxation and characterize the extreme inequalities when there are two integer variables.