On the relative strength of different generalizations of split cuts

DOI10.1016/j.disopt.2014.12.003zbMath1387.90155OpenAlexW2035821392MaRDI QIDQ1751106

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

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

integer programmingcutting planesplit cutcut strength

Mathematics Subject Classification ID

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

Related Items

Theoretical challenges towards cutting-plane selection ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Lattice closures of polyhedra ⋮ Cut generation through binarization ⋮ Lower bounds on the size of general branch-and-bound trees ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs ⋮ The aggregation closure is polyhedral for packing and covering integer programs

Cites Work

• Unnamed Item
• On \(t\)-branch split cuts for mixed-integer programs
• On mixed-integer sets with two integer variables
• A heuristic to generate rank-1 GMI cuts
• A note on the MIR closure and basic relaxations of polyhedra
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• MIR closures of polyhedral sets
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• The 0-1 knapsack problem with a single continuous variable
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• A relax-and-cut framework for Gomory mixed-integer cuts
• Split closure and intersection cuts
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• On optimizing over lift-and-project closures
• Optimizing over the split closure
• Some polyhedra related to combinatorial problems
• Gomory cuts revisited
• The Chvátal-Gomory Closure of a Strictly Convex Body
• Intersection Cuts with Infinite Split Rank
• A Geometric Perspective on Lifting
• On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Inequalities from Two Rows of a Simplex Tableau
• A disjunctive cutting plane procedure for general mixed-integer linear programs
• Elementary closures for integer programs.