The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope
From MaRDI portal
Publication:5176373
DOI10.1007/978-3-642-29210-1_93zbMath1306.90098OpenAlexW4231533032MaRDI QIDQ5176373
Juliane Dunkel, Andreas S. Schulz
Publication date: 3 March 2015
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_93
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete geometry (52C99)
Related Items (5)
On polytopes with linear rank with respect to generalizations of the split closure ⋮ On the Chvátal-Gomory Closure of a Compact Convex Set ⋮ 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
Cites Work
- Unnamed Item
- Valid inequalities for mixed integer linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- The Chvátal-Gomory Closure of a Strictly Convex Body
- On the Chvátal-Gomory Closure of a Compact Convex Set
- 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
- Arbitrarily Complex Corner Polyhedra are Dense in $R^n $
This page was built for publication: The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope