On mixed-integer sets with two integer variables
From MaRDI portal
Publication:408383
DOI10.1016/j.orl.2011.06.010zbMath1252.90053OpenAlexW2114379709MaRDI QIDQ408383
Santanu S. Dey, Sanjeeb Dash, Oktay Günlük
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.010
Related Items
Theoretical challenges towards cutting-plane selection ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Lattice closures of polyhedra ⋮ On polytopes with linear rank with respect to generalizations of the split closure ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ On the relative strength of different generalizations of split cuts ⋮ Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming ⋮ Relaxations of mixed integer sets from lattice-free polyhedra
Cites Work
- Unnamed Item
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Chvátal closures for mixed integer programming problems
- The stable set polytope of quasi-line graphs
- Cook, Kannan and Schrijver's example revisited
- Mixed-integer sets from two rows of two adjacent simplex bases
- Disjunctive Programming
- Inequalities from Two Rows of a Simplex Tableau
- Convex Analysis
