Mixed-integer sets from two rows of two adjacent simplex bases
From MaRDI portal
Publication:2638388
DOI10.1007/s10107-010-0376-4zbMath1211.90138MaRDI QIDQ2638388
Robert Weismantel, Kent Andersen, Quentin Louveaux
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0376-4
Related Items
On mixed-integer sets with two integer variables, Strengthening lattice-free cuts using non-negativity, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, An algorithm for the separation of two-row cuts, The strength of multi-row models
Cites Work
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the facets of mixed integer programs with two integer variables and two constraints
- Some polyhedra related to combinatorial problems
- Minimal requirements for Minkowski's theorem in the plane I
- Inequalities from Two Rows of a Simplex Tableau
- Some continuous functions related to corner polyhedra