On the Chvátal-Gomory Closure of a Compact Convex Set
From MaRDI portal
Publication:3009756
DOI10.1007/978-3-642-20807-2_11zbMath1339.52006arXiv1011.1710OpenAlexW2164303918MaRDI QIDQ3009756
Juan Pablo Vielma, Daniel Dadush, Santanu S. Dey
Publication date: 24 June 2011
Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1710
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (max. 100)
Integer packing sets form a well-quasi-ordering ⋮ On finitely generated closures in the theory of cutting planes ⋮ Design and verify: a new scheme for generating cutting-planes ⋮ On the Chvátal-Gomory closure of a compact convex set ⋮ The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope ⋮ A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
Cites Work
- Unnamed Item
- Unnamed Item
- Optimizing over the first Chvátal closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- The Chvátal-Gomory Closure of a Strictly Convex Body
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Outline of an algorithm for integer solutions to linear programs
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
- On Cutting Planes
- The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope
- Paths, Trees, and Flowers
This page was built for publication: On the Chvátal-Gomory Closure of a Compact Convex Set