Equivalence between intersection cuts and the corner polyhedron

DOI10.1016/j.orl.2010.02.006zbMath1187.90196OpenAlexW2114522888MaRDI QIDQ974981

Giacomo Zambelli, Michele Conforti, Cornuéjols, Gérard

Publication date: 8 June 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.02.006

zbMATH Keywords

integer programmingcutting planecorner polyhedronintersection cut

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximal Quadratic-Free Sets, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, The structure of the infinite models in integer programming, Computational Experiments with Cross and Crooked Cross Cuts, Outer-product-free sets for polynomial optimization and oracle-based cuts, A 3-slope theorem for the infinite relaxation in the plane, Intersection cuts from multiple rows: a disjunctive programming approach, Disjunctive programming and relaxations of polyhedra, Relaxations of mixed integer sets from lattice-free polyhedra, Sufficiency of cut-generating functions, A quantitative Doignon-Bell-Scarf theorem, Intersection cuts -- standard versus restricted, Intersection cuts for convex mixed integer programs from translated cones, Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\), Relaxations of mixed integer sets from lattice-free polyhedra, Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Cut-Generating Functions for Integer Variables, Maximal quadratic-free sets

Cites Work

• Unnamed Item
• MIR closures of polyhedral sets
• Chvátal closures for mixed integer programming problems
• T-space and cutting planes
• Split closure and intersection cuts
• Some polyhedra related to combinatorial problems
• A constructive characterization of the split closure of a mixed integer linear program
• Minimal Valid Inequalities for Integer Constraints
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming