On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
From MaRDI portal
Publication:1801017
DOI10.1007/S10107-017-1226-4zbMATH Open1414.90231OpenAlexW2791467357MaRDI QIDQ1801017FDOQ1801017
Authors: Dabeen Lee, Gérard Cornuéjols 
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1226-4
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Outline of an algorithm for integer solutions to linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- On the Chvátal-Gomory closure of a compact convex set
- On Cutting Planes
- The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
- Title not available (Why is that?)
- On cutting-plane proofs in combinatorial optimization
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- On the Chvátal rank of polytopes in the 0/1 cube
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
- Title not available (Why is that?)
- On the rank of mixed 0,1 polyhedra.
- Ideal clutters that do not pack
- 0/1 polytopes with quadratic Chvátal rank
- Forbidden vertices
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
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)
