Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
From MaRDI portal
(Redirected from Publication:715090)
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
Cites work
- A geometric perspective on lifting
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Characterization of facets for multiple right-hand choice linear programs
- Chvátal closures for mixed integer programming problems
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- Computing with Multi-row Gomory Cuts
- Constrained infinite group relaxations of MIPs
- Cook, Kannan and Schrijver's example revisited
- Corner polyhedra and their connection with cutting planes
- Disjunctive Programming
- Equivalence between intersection cuts and the corner polyhedron
- Experiments with two row tableau cuts
- Experiments with two-row cuts from degenerate tableaux
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Maximal lattice-free convex sets in linear subspaces
- Minimal inequalities for an infinite relaxation of integer programs
- Minimal valid inequalities for integer constraints
- Mixed-integer sets from two rows of two adjacent simplex bases
- On degenerate multi-row Gomory cuts
- On lifting integer variables in minimal inequalities
- On the facets of mixed integer programs with two integer variables and two constraints
- On the rank of mixed 0,1 polyhedra.
- On the relative strength of split, triangle and quadrilateral cuts
- Some continuous functions related to corner polyhedra, II
- Strengthening cuts for mixed integer programs
- Strengthening lattice-free cuts using non-negativity
- Two row mixed-integer cuts via lifting
Cited in
(15)- Theoretical challenges towards cutting-plane selection
- On the relative strength of different generalizations of split cuts
- Lattice closures of polyhedra
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- The strength of multi-row models
- Computational experiments with cross and crooked cross cuts
- Design and verify: A new scheme for generating cutting-planes
- When Lift-and-Project Cuts Are Different
- On the polyhedrality of cross and quadrilateral closures
- On mixed-integer sets with two integer variables
- Monoidal cut strengthening revisited
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
- Relaxations of mixed integer sets from lattice-free polyhedra
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
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)
