A note on the split rank of intersection cuts
From MaRDI portal
Publication:647399
Recommendations
Cites work
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- A constructive characterization of the split closure of a mixed integer linear program
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Chvátal closures for mixed integer programming problems
- Computing with Multi-row Gomory Cuts
- Cook, Kannan and Schrijver's example revisited
- Cutting planes in integer and mixed integer programming
- Disjunctive Programming
- Elementary closures for integer programs.
- Gomory cuts revisited
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Minimal valid inequalities for integer constraints
- Mixing mixed-integer inequalities
- On degenerate multi-row Gomory cuts
- On mixing inequalities: rank, closure, and cutting-plane proofs
- On the MIR Closure of Polyhedra
- 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
- Optimizing over the split closure
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Production Planning by Mixed Integer Programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Some continuous functions related to corner polyhedra, II
- Split closure and intersection cuts
- Strengthening cuts for mixed integer programs
- Tight formulations for some simple mixed integer programs and convex objective integer programs
Cited in
(27)- On mixing inequalities: rank, closure, and cutting-plane proofs
- Optimizing over the split closure
- Disjunctive programming and relaxations of polyhedra
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- Two-halfspace closure
- Split closure and intersection cuts
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- scientific article; zbMATH DE number 1757948 (Why is no real title available?)
- Cook, Kannan and Schrijver's example revisited
- Nonunique lifting of integer variables in minimal inequalities
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Multirow Intersection Cuts Based on the Infinity Norm
- scientific article; zbMATH DE number 5943737 (Why is no real title available?)
- Intersection cuts with infinite Split rank
- On the rank of disjunctive cuts
- Split rank of triangle and quadrilateral inequalities
- Characterization of the split closure via geometric lifting
- Theoretical challenges towards cutting-plane selection
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Cutting planes from extended LP formulations
- On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Intersection cuts for convex mixed integer programs from translated cones
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- On polytopes with linear rank with respect to generalizations of the split closure
- scientific article; zbMATH DE number 2086918 (Why is no real title available?)
This page was built for publication: A note on the split rank of intersection cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647399)
