Split closure and intersection cuts
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086918
- Intersection cuts with infinite Split rank
- A note on the split rank of intersection cuts
- Obtaining splits from cut sets of tight spans
- Cut-Set Intersections and Node Partitions
- Intersection cuts -- standard versus restricted
- On disconnected cuts and separators
- Generalized intersection cuts and a new cut generating paradigm
- On the separation of split cuts and related inequalities
- Hypergraph Cuts with General Splitting Functions
Cites work
- 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
- Chvátal closures for mixed integer programming problems
- Disjunctive Programming
- Elementary closures for integer programs.
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- Integer Programming and Pricing
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- On the rank of mixed 0,1 polyhedra.
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
Cited in
(42)- Stable sets, corner polyhedra and the Chvàtal closure
- Theoretical challenges towards cutting-plane selection
- On the relative strength of different generalizations of split cuts
- On a generalization of the Chvátal-Gomory closure
- Lattice closures of polyhedra
- The split closure of a strictly convex body
- Lift-and-project for general two-term disjunctions
- On optimizing over lift-and-project closures
- Cutting planes from wide split disjunctions
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Disjunctive programming and relaxations of polyhedra
- Optimizing over the split closure
- A constructive characterization of the split closure of a mixed integer linear program
- Two-halfspace closure
- The Chvátal closure of generalized stable sets in bidirected graphs
- Disjunctive Cuts for Nonconvex MINLP
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Characterization of the split closure via geometric lifting
- When Lift-and-Project Cuts Are Different
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- On the polyhedrality of cross and quadrilateral closures
- scientific article; zbMATH DE number 2086918 (Why is no real title available?)
- On some generalizations of the split closure
- On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
- Split cuts in the plane
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Elementary closures for integer programs.
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- A note on the MIR closure and basic relaxations of polyhedra
- A note on the split rank of intersection cuts
- \(\mathcal{V}\)-polyhedral disjunctive cuts
- Last fifty years of integer linear programming: a focus on recent practical advances
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Branching with a pre-specified finite list of k-sparse split sets for binary MIPs
- MIR closures of polyhedral sets
- The mixing-MIR set with divisible capacities
- Cook, Kannan and Schrijver's example revisited
- Equivalence between intersection cuts and the corner polyhedron
- Valid inequalities for mixed integer linear programs
This page was built for publication: Split closure and intersection cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774172)
