On the facets of mixed integer programs with two integer variables and two constraints
From MaRDI portal
Publication:2390999
DOI10.1007/s10107-008-0221-1zbMath1180.90207OpenAlexW2086069279MaRDI QIDQ2390999
Cornuéjols, Gérard, Margot, François
Publication date: 24 July 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0221-1
Related Items
Intersection cuts for single row corner relaxations, Origin and early evolution of corner polyhedra, Mixed-integer sets from two rows of two adjacent simplex bases, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, On the relative strength of split, triangle and quadrilateral cuts, Cut generation through binarization, On the Practical Strength of Two-Row Tableau Cuts, The master equality polyhedron with multiple rows, Composite lifting of group inequalities and an application to two-row mixing inequalities, Strengthening lattice-free cuts using non-negativity, An algorithm for the separation of two-row cuts, A note on the split rank of intersection cuts, Intersection cuts from multiple rows: a disjunctive programming approach, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, The triangle closure is a polyhedron, Computing with multi-row gomory cuts, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, The strength of multi-row models, Minimal cut-generating functions are nearly extreme, On Minimal Valid Inequalities for Mixed Integer Conic Programs, The strength of multi-row aggregation cuts for sign-pattern integer programs, When Lift-and-Project Cuts Are Different, Stable sets, corner polyhedra and the Chvàtal closure, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, A geometric approach to cut-generating functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- Some polyhedra related to combinatorial problems
- Minimal Valid Inequalities for Integer Constraints
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- On the existence of optimal solutions to integer and mixed-integer programming problems
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- On the rank of mixed 0,1 polyhedra.
