Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
From MaRDI portal
Publication:715090
DOI10.1007/S10107-011-0455-1zbMATH Open1269.90068OpenAlexW2154900771MaRDI QIDQ715090FDOQ715090
Authors: Sanjeeb Dash, Santanu S. Dey, Oktay Günlük 
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0455-1
Recommendations
- On mixed-integer sets with two integer variables
- Computational experiments with cross and crooked cross cuts
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- On the relative strength of different generalizations of split cuts
- On the polyhedrality of cross and quadrilateral closures
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Strengthening cuts for mixed integer programs
- Corner polyhedra and their connection with cutting planes
- Two row mixed-integer cuts via lifting
- Constrained infinite group relaxations of MIPs
- Minimal inequalities for an infinite relaxation of integer programs
- A geometric perspective on lifting
- Minimal valid inequalities for integer constraints
- Maximal lattice-free convex sets in linear subspaces
- 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, II
- Disjunctive Programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- On the relative strength of split, triangle and quadrilateral cuts
- Chvátal closures for mixed integer programming problems
- On the facets of mixed integer programs with two integer variables and two constraints
- Title not available (Why is that?)
- Cook, Kannan and Schrijver's example revisited
- Equivalence between intersection cuts and the corner polyhedron
- On lifting integer variables in minimal inequalities
- Mixed-integer sets from two rows of two adjacent simplex bases
- On degenerate multi-row Gomory cuts
- Computing with Multi-row Gomory Cuts
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- Strengthening lattice-free cuts using non-negativity
- Characterization of facets for multiple right-hand choice linear programs
- Experiments with two-row cuts from degenerate tableaux
- Experiments with two row tableau cuts
- On the rank of mixed 0,1 polyhedra.
Cited In (15)
- Computational Experiments with Cross and Crooked Cross Cuts
- On mixed-integer sets with two integer variables
- Monoidal cut strengthening revisited
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Theoretical challenges towards cutting-plane selection
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Design and verify: A new scheme for generating cutting-planes
- The strength of multi-row models
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- On the polyhedrality of cross and quadrilateral closures
- Relaxations of mixed integer sets from lattice-free polyhedra
- When Lift-and-Project Cuts Are Different
- On the relative strength of different generalizations of split cuts
- Lattice closures of polyhedra
This page was built for publication: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715090)
