Cook, Kannan and Schrijver's example revisited

DOI10.1016/j.disopt.2008.05.002zbMath1190.90107OpenAlexW1966924261MaRDI QIDQ955332

Jean-Philippe P. Richard, Yanjun Li

Publication date: 19 November 2008

Published in: Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

mixed-integer programmingsplit cutssplit closuresplit rank

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (max. 100)

Theoretical challenges towards cutting-plane selection ⋮ On the polyhedrality of cross and quadrilateral closures ⋮ Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ On \(t\)-branch split cuts for mixed-integer programs ⋮ Lattice closures of polyhedra ⋮ On mixed-integer sets with two integer variables ⋮ Cut generation through binarization ⋮ On polytopes with linear rank with respect to generalizations of the split closure ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Complexity of optimizing over the integers ⋮ A note on the split rank of intersection cuts ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ On the relative strength of different generalizations of split cuts ⋮ Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming ⋮ Semi-continuous network flow problems ⋮ Computing with multi-row gomory cuts ⋮ Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ When Lift-and-Project Cuts Are Different ⋮ On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• Chvátal closures for mixed integer programming problems
• Disjunctive programming: Properties of the convex hull of feasible points
• On the separation of split cuts and related inequalities
• Split closure and intersection cuts
• A connection between cutting plane theory and the geometry of numbers
• Disjunctive Programming
• Inequalities from Two Rows of a Simplex Tableau
• A disjunctive cutting plane procedure for general mixed-integer linear programs

This page was built for publication: Cook, Kannan and Schrijver's example revisited