Mathematical Programming

, Volume 172, Issue 1–2, pp 467–503 | Cite as

On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank

  • Gérard CornuéjolsEmail author
  • Dabeen Lee
Full Length Paper Series B


In this paper, we consider polytopes P that are contained in the unit hypercube. We provide conditions on the set of 0, 1 vectors not contained in P that guarantee that P has a small Chvátal rank. Our conditions are in terms of the subgraph induced by these infeasible 0, 1 vertices in the skeleton graph of the unit hypercube. In particular, we show that when this subgraph contains no 4-cycle, the Chvátal rank is at most 3; and when it has tree width 2, the Chvátal rank is at most 4. We also give polyhedral decomposition theorems when this graph has a vertex cutset of size one or two.

Mathematics Subject Classification

90C10 90C27 90C57 



This work was supported in part by NSF Grant CMMI1560828 and ONR Grant N00014-15-12082. We would like to thank the referees for carefully reading an earlier draft of the paper and providing valuable comments.


  1. 1.
    Abdi, A., Cornuéjols, G., Pashkovich, K.: Ideal clutters that do not pack. Math. Oper. Res. (2017). MathSciNetCrossRefGoogle Scholar
  2. 2.
    Angulo, G., Ahmed, S., Dey, S.S., Kaibel, V.: Forbidden vertices. Math. Oper. Res. 40, 350–360 (2015)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bockmayr, A., Eisenbrand, F., Hartmann, M., Schulz, A.S.: On the Chvátal rank of polytopes in the 0/1 cube. Discrete Appl. Math. 98, 21–27 (1999)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4, 305–337 (1973)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chvátal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114/115, 455–499 (1989)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cornuéjols, G., Li, Y.: On the rank of mixed 0, 1 polyhedra. Math. Program. Ser. A 91, 391–397 (2002)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Cornuéjols, G., Li, Y.: Deciding emptiness of the Gomory–Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point. In: Louveaux, Q., Skutella, M. (eds.) IPCO, vol. 9682, pp. 387–397. LNCS (2016)zbMATHGoogle Scholar
  8. 8.
    Cornuéjols, G., Lee, D., Li, Y.: On the rational polytopes with Chvátal rank 1. SubmittedGoogle Scholar
  9. 9.
    Dadush, D., Dey, S.S., Vielma, J.P.: On the Chvátal–Gomory closure of a compact convex set. Math. Program. Ser. A 145, 327–348 (2014)CrossRefGoogle Scholar
  10. 10.
    Dunkel, J., Schulz, A.S.: The Gomory–Chvátal closure of a nonrational polytope is a rational polytope. Math. Oper. Res. 38, 63–91 (2013)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Eisenbrand, F., Schulz, A.S.: Bounds on the Chvátal rank of polytopes in the 0/1 cube. Combinatorica 23, 245–261 (2003)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Ghouila-Houri, A.: Caractérisation des matrices totalement unimodulaires. Compt. Rendus Hebd. Scé. l’Acad. Sci. (Paris) 254, 1192–1194 (1962)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275–278 (1958)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Hartmann, M.E., Queyranne, M., Wang, Y.: On the Chvátal rank of certain inequalities. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO, vol. 1610, pp. 218–233. LNCS (1999)CrossRefGoogle Scholar
  15. 15.
    Pokutta, S., Schulz, A.S.: Integer-empty polytopes in the 0/1-cube with maximal Gomory–Chvátal rank. Oper. Res. Lett. 39, 457–460 (2011)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Rothvoss, T., Sanitá, L.: 0/1 polytopes with quadratic Chvátal rank. In: Goemans, M., Correa, J. (eds.) IPCO, vol. 7801, pp. 349–361. LNCS (2013)Google Scholar
  17. 17.
    Schrijver, A.: On cutting planes. Ann. Discrete Math. 9, 291–296 (1980)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society 2018

Authors and Affiliations

  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations