On the relative strength of different generalizations of split cuts

DOI10.1016/J.DISOPT.2014.12.003MaRDI QIDQ1751106zbMATH OpenOpenAlexFDO

Authors Sanjeeb Dash, Oktay Günlük, Marco Molinaro

Publication date 24 May 2018

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.12.003

zbMATH Keywords

cut strengthcutting planeinteger programmingsplit cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Computational experiments with cross and crooked cross cuts
• On some generalizations of the split closure
• On the polyhedrality of cross and quadrilateral closures
• scientific article; zbMATH DE number 2086918
• Split closure and intersection cuts

Cites work

• A disjunctive cutting plane procedure for general mixed-integer linear programs
• A geometric perspective on lifting
• A heuristic to generate rank-1 GMI cuts
• A note on the MIR closure and basic relaxations of polyhedra
• 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
• A relax-and-cut framework for Gomory mixed-integer cuts
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Elementary closures for integer programs.
• Gomory cuts revisited
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Inequalities from Two Rows of a Simplex Tableau
• Intersection cuts with infinite Split rank
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• MIR closures of polyhedral sets
• On t-branch split cuts for mixed-integer programs
• On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows
• On mixed-integer sets with two integer variables
• On optimizing over lift-and-project closures
• Optimizing over the split closure
• Some polyhedra related to combinatorial problems
• Split closure and intersection cuts
• The 0-1 knapsack problem with a single continuous variable
• The Chvátal-Gomory closure of a strictly convex body
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra

Cited in

(17)

• A generalized \(\alpha\)-cut
• Theoretical challenges towards cutting-plane selection
• The aggregation closure is polyhedral for packing and covering integer programs
• Partial hyperplane activation for generalized intersection cuts
• Lattice closures of polyhedra
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• Lower bounds on the size of general branch-and-bound trees
• Computational experiments with cross and crooked cross cuts
• A probabilistic analysis of the strength of the split and triangle closures
• On the polyhedrality of cross and quadrilateral closures
• On some generalizations of the split closure
• Hypergraph Cuts with General Splitting Functions
• On the relative strength of split, triangle and quadrilateral cuts
• Last fifty years of integer linear programming: a focus on recent practical advances
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Branch-and-bound versus lift-and-project relaxations in combinatorial optimization
• Cut generation through binarization

This page was built for publication: On the relative strength of different generalizations of split cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751106)