On the rational polytopes with Chvátal rank 1
From MaRDI portal
Publication:2288183
Recommendations
- \(0/1\) polytopes with quadratic Chvátal rank
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- On the Chvátal rank of polytopes in the 0/1 cube
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
- 0/1 polytopes with quadratic Chvátal rank
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Covering minima and lattice-point-free convex bodies
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Edmonds polytopes and a hierarchy of combinatorial problems
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Facet generating techniques
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342145 (Why is no real title available?)
- scientific article; zbMATH DE number 2079379 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3046578 (Why is no real title available?)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Integer Programming with a Fixed Number of Variables
- Matrices with the Edmonds-Johnson property
- Minkowski's Convex Body Theorem and Integer Programming
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- On Cutting Planes
- On cutting-plane proofs in combinatorial optimization
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
- On the Chvátal-Gomory closure of a compact convex set
- On the complexity of selecting disjunctions in integer programming
- On the membership problem for the \({0, 1/2}\)-closure
- On the membership problem for the elementary closure of a polyhedron
- Paths, Trees, and Flowers
- The Centroid of a Convex Body
- The Chvátal-Gomory closure of a strictly convex body
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
- The ellipsoid method and its consequences in combinatorial optimization
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- When the Gomory-chvátal closure coincides with the integer hull
- Über eine Affininvariante von Eibereichen
Cited in
(7)- On the Chvátal rank of polytopes in the 0/1 cube
- On recognizing integer polyhedra
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- \(0/1\) polytopes with quadratic Chvátal rank
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Primal separation and approximation for the \(\{0,1/2\}\)-closure
This page was built for publication: On the rational polytopes with Chvátal rank 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288183)
