Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank

References

• Bienstock D, Zuckerberg M (2004) Subset algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15(1):63–95.Crossref, Google Scholar
• Boyd S, Pulleyblank WR (2009) Facet generating techniques. Research Trends in Combinatorial Optimization (Springer, Berlin), 33–55.Crossref, Google Scholar
• Chvátal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4(4):305–337.Crossref, Google Scholar
• Chvátal V, Cook W, Hartmann M (1989) On cutting-plane proofs in combinatorial optimization. Linear Algebra Its Appl. 114–115:455–499.Crossref, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming (Springer Internatioinal, Cham, Switzerland).Crossref, Google Scholar
• Conforti M, Pia AD, Summa MD, Faenza Y, Grappe R (2015) Reverse Chvátal-Gomory rank. SIAM J. Discrete Math. 29(1):166–181.Crossref, Google Scholar
• Cornuéjols G, Lee D (2016) On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank. Louveaux Q, Skutella M, eds. Proc. 18th Internat. Conf. Integer Programming Combinatorial Optim., IPCO ’16 (Springer International, Cham, Switzerland), 300–311.Google Scholar
• Dadush D, Dey SS, Vielma JP (2014) On the Chvátal-Gomory closure of a compact convex set. Math. Programming 145(1–2):327–348.Crossref, Google Scholar
• Diestel R (2010) Graph Theory, Graduate Texts in Mathematics, Vol. 173 (Springer, Berlin).Crossref, Google Scholar
• Eisenbrand F, Schulz AS (2003) Bounds on the Chvátal rank of polytopes in the 0/1-cube. Combinatorica 23(2):245–261.Crossref, Google Scholar
• Rothvoß T, Sanità L (2013) 0/1 polytopes with quadratic Chvátal rank. Goemans MX, Correa JR, eds. Proc. 16th Internat. Conf. Integer Programming Combinatorial Optim., IPCO ’13 (Springer, Berlin), 349–361.Crossref, Google Scholar
• Singh M, Talwar K (2010) Improving integrality gaps via Chvátal-Gomory rounding. Serna M, Shaltiel R, Jansen K, Rolim J, eds. Proc. 13th Internat. Workshop Approximation, Randomization, and Combinatorial Optim., APPROX ’10 (Springer, Berlin), 366–379.Crossref, Google Scholar