On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
From MaRDI portal
(Redirected from Publication:1801017)
Recommendations
Cites work
- scientific article; zbMATH DE number 1342132 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- 0/1 polytopes with quadratic Chvátal rank
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- Edmonds polytopes and a hierarchy of combinatorial problems
- Forbidden vertices
- Ideal clutters that do not pack
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
- On Cutting Planes
- On cutting-plane proofs in combinatorial optimization
- On the Chvátal rank of polytopes in the 0/1 cube
- On the Chvátal-Gomory closure of a compact convex set
- On the rank of mixed 0,1 polyhedra.
- Outline of an algorithm for integer solutions to linear programs
- The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
Cited in
(4)
This page was built for publication: On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801017)