Split closure and intersection cuts

DOI10.1007/3-540-47867-1_10MaRDI QIDQ4737523zbMATH OpenFDO

Authors K. H. Andersen, Gérard Cornuéjols, Yanjun Li

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370127.htm

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

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)

• On the relative strength of different generalizations of split cuts
• Intersection cuts -- standard versus restricted
• Split closure and intersection cuts
• On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
• Cutting planes from wide split disjunctions
• Optimizing over the split closure
• A constructive characterization of the split closure of a mixed integer linear program
• Two-halfspace closure
• Intersection cuts with infinite Split rank
• Characterization of the split closure via geometric lifting
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• On the polyhedrality of cross and quadrilateral closures
• Split cuts for robust mixed-integer optimization
• On some generalizations of the split closure
• Split cuts in the plane
• On the MIR Closure of Polyhedra
• Elementary closures for integer programs.
• A note on the split rank of intersection cuts
• MIR closures of polyhedral sets
• The stable set polytope of quasi-line graphs
• Cook, Kannan and Schrijver's example revisited

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 Q4737523)