Equivalence between intersection cuts and the corner polyhedron

Authors:
Michele Conforti;GéRard CornuéJols;Giacomo Zambelli
Affiliations:
Universití di Padova, Italy;Carnegie Mellon University, United States;Universití di Padova, Italy
Venue:
Operations Research Letters
Year:
2010

Citing 6
Cited 0

Chva´tal closures for mixed integer programming problems

Mathematical Programming: Series A and B
Split closure and intersection cuts

Mathematical Programming: Series A and B
MIR closures of polyhedral sets

Mathematical Programming: Series A and B
Minimal Valid Inequalities for Integer Constraints

Mathematics of Operations Research
A counterexample to a conjecture of Gomory and Johnson

Mathematical Programming: Series A and B
A constructive characterization of the split closure of a mixed integer linear program

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. Balas showed that intersection cuts are valid for the corner polyhedron. In this paper we show that, conversely, every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut.