Equivalence between intersection cuts and the corner polyhedron

DOI10.1016/J.ORL.2010.02.006zbMATH Open1187.90196OpenAlexW2114522888MaRDI QIDQ974981FDOQ974981

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

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

Recommendations

• Corner polyhedra and their connection with cutting planes
• Intersection cuts -- standard versus restricted
• A geometric approach to cut-generating functions
• Split closure and intersection cuts
• Approximation of corner polyhedra with families of intersection cuts

zbMATH Keywords

integer programmingcutting planecorner polyhedronintersection cut

Mathematics Subject Classification ID

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

Cites Work

• T-space and cutting planes
• Some polyhedra related to combinatorial problems
• Minimal valid inequalities for integer constraints
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Split closure and intersection cuts
• Chvátal closures for mixed integer programming problems
• A constructive characterization of the split closure of a mixed integer linear program
• Title not available (Why is that?)
• MIR closures of polyhedral sets

Cited In (27)

• On minimal valid inequalities for mixed integer conic programs
• Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\)
• Disjunctive programming and relaxations of polyhedra
• Maximal quadratic-free sets
• Maximal quadratic-free sets
• A quantitative Doignon-Bell-Scarf theorem
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Intersection cuts for convex mixed integer programs from translated cones
• Approximation of corner polyhedra with families of intersection cuts
• Approximation of corner polyhedra with families of intersection cuts
• Corner polyhedra and their connection with cutting planes
• Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality
• Sufficiency of cut-generating functions
• Origin and early evolution of corner polyhedra
• Title not available (Why is that?)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• A 3-slope theorem for the infinite relaxation in the plane
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra
• Intersection cuts from multiple rows: a disjunctive programming approach
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Corner cuts and their polytopes
• Cut-generating functions for integer variables
• Computational experiments with cross and crooked cross cuts
• Intersection cuts -- standard versus restricted

This page was built for publication: Equivalence between intersection cuts and the corner polyhedron

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