scientific article; zbMATH DE number 2086918
From MaRDI portal
Publication:4737523
Recommendations
- Split closure and intersection cuts
- 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
Cited in
(21)- Intersection cuts with infinite Split rank
- On the MIR Closure of Polyhedra
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
- A constructive characterization of the split closure of a mixed integer linear program
- Cutting planes from wide split disjunctions
- A note on the split rank of intersection cuts
- Characterization of the split closure via geometric lifting
- The stable set polytope of quasi-line graphs
- Elementary closures for integer programs.
- On some generalizations of the split closure
- Split cuts in the plane
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- On the polyhedrality of cross and quadrilateral closures
- Split closure and intersection cuts
- MIR closures of polyhedral sets
- Cook, Kannan and Schrijver's example revisited
- Two-halfspace closure
- On the relative strength of different generalizations of split cuts
- Split cuts for robust mixed-integer optimization
- Optimizing over the split closure
- Intersection cuts -- standard versus restricted
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737523)
