On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
From MaRDI portal
Publication:5458539
DOI10.1007/978-3-540-78773-0_28zbMath1136.90415MaRDI QIDQ5458539
Margot, François, Cornuéjols, Gérard
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_28
90C11: Mixed integer programming
Related Items
Two row mixed-integer cuts via lifting, Computing with Multi-row Gomory Cuts, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- Minimal Valid Inequalities for Integer Constraints
- 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