The Chvátal-Gomory Closure of a Strictly Convex Body

Authors:
Daniel Dadush;Santanu S. Dey;Juan Pablo Vielma
Affiliations:
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332;Business Analytics and Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, and Department of Industrial Engineering, University of Pittsburgh, Pit ...
Venue:
Mathematics of Operations Research
Year:
2011

Citing 16
Cited 4

Theory of linear and integer programming

Theory of linear and integer programming
Integer and combinatorial optimization

Integer and combinatorial optimization
Combinatorial optimization

Combinatorial optimization
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

INFORMS Journal on Computing
Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation

Computational Optimization and Applications
Cuts for mixed 0-1 conic programming

Mathematical Programming: Series A and B
Perspective cuts for a class of convex 0–1 mixed integer programs

Mathematical Programming: Series A and B
Conic mixed-integer rounding cuts

Mathematical Programming: Series A and B
Lifting inequalities: a framework for generating strong cuts for nonlinear programs

Mathematical Programming: Series A and B
Binary positive semidefinite matrices and associated integer polytopes

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Perspective reformulations of mixed integer nonlinear programs with indicator variables

Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
Lifting for conic mixed-integer programming

Mathematical Programming: Series A and B
The chvátal-gomory closure of an ellipsoid is a polyhedron

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
The submodular knapsack polytope

Discrete Optimization
An algorithmic framework for convex mixed integer nonlinear programs

Discrete Optimization

On the Chvátal-Gomory closure of a compact convex set

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope

Mathematics of Operations Research
Facial structure and representation of integer hulls of convex sets

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
0/1 polytopes with quadratic chvátal rank

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we prove that the Chvátal-Gomory closure of a set obtained as an intersection of a strictly convex body and a rational polyhedron is a polyhedron. Thus, we generalize a result of Schrijver [Schrijver, A. 1980. On cutting planes. Ann. Discrete Math.9 291--296], which shows that the Chvátal-Gomory closure of a rational polyhedron is a polyhedron.