Split closure and intersection cuts
From MaRDI portal
Publication:1774172
DOI10.1007/s10107-004-0558-zzbMath1066.90070OpenAlexW2111574881MaRDI QIDQ1774172
Kent Andersen, Yanjun Li, Cornuéjols, Gérard
Publication date: 29 April 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0558-z
Related Items
Disjunctive Cuts for Nonconvex MINLP, MIR closures of polyhedral sets, Characterization of the split closure via geometric lifting, Theoretical challenges towards cutting-plane selection, A constructive characterization of the split closure of a mixed integer linear program, On optimizing over lift-and-project closures, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, On the polyhedrality of cross and quadrilateral closures, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Lattice closures of polyhedra, On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Two-halfspace closure, A note on the MIR closure and basic relaxations of polyhedra, A note on the split rank of intersection cuts, Disjunctive programming and relaxations of polyhedra, The mixing-MIR set with divisible capacities, Relaxations of mixed integer sets from lattice-free polyhedra, Split Cuts in the Plane, On the relative strength of different generalizations of split cuts, Cook, Kannan and Schrijver's example revisited, Optimizing over the split closure, Relaxations of mixed integer sets from lattice-free polyhedra, Equivalence between intersection cuts and the corner polyhedron, The split closure of a strictly convex body, Valid inequalities for mixed integer linear programs, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, When Lift-and-Project Cuts Are Different, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, The Chvátal closure of generalized stable sets in bidirected graphs, Stable sets, corner polyhedra and the Chvàtal closure, Lift-and-project for general two-term disjunctions, On a generalization of the Chvátal-Gomory closure
Cites Work
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
- Integer Programming and Pricing
- Disjunctive Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Elementary closures for integer programs.
- On the rank of mixed 0,1 polyhedra.
