Skip to main content
Log in

Reverse split rank

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

The reverse split rank of an integral polyhedron \(P\) is defined as the supremum of the split ranks of all rational polyhedra whose integer hull is \(P\). Already in \(\mathbb {R}^3\) there exist polyhedra with infinite reverse split rank. We give a geometric characterization of the integral polyhedra in \(\mathbb {R}^n\) with infinite reverse split rank.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Averkov, G., Conforti, M., Del Pia, A., Di Summa, M., Faenza, Y.: On the convergence of the affine hull of the Chvátal–Gomory closures. SIAM J. Discrete Math. 27, 1492–1502 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  2. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89, 3–44 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barvinok, A.: A course in convexity. Grad. Stud. Math. 54. AMS, Providence (2002)

  4. Basu, A., Conforti, M., Cornuéjols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35, 704–720 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Basu, A., Cornuéjols, G., Margot, F.: Intersection cuts with infinite split rank. Math. Oper. Res. 37, 21–40 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Conforti, M., Del Pia, A., Di Summa, M., Faenza, Y., Grappe, R.: Reverse Chvátal-Gomory rank. In: Goemans, M., Correa, J. (eds.) Proceedings of the XVI International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 7801, pp. 133–144. Springer, Heidelberg (2013)

    Google Scholar 

  7. Conforti, M., Del Pia, A., Di Summa, M., Faenza, Y., Grappe, R.: Reverse Chvátal–Gomory rank. SIAM J. Discrete Math. 29, 166–181 (2015)

  8. Cook, W., Coullard, C.R., Túran, G.: On the complexity of cutting-plane proofs. Discrete Appl. Math. 18, 25–38 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155–174 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Del Pia, A.: On the rank of disjunctive cuts. Math. Oper. Res. 37, 372–378 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  11. Del Pia, A., Weismantel, R.: On convergence in mixed integer programming. Math. Program. 135, 397–412 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  12. Eisenbrand, F., Schulz, A.S.: Bounds on the Chvátal rank of polytopes in the \(0/1\) cube. Combinatorica 23, 245–261 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kannan, R., Lovasz, L.: Covering minima and lattice-point-free convex bodies. Ann. Math. Second Ser. 128, 577–602 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  14. Khintchine, A.: A quantitative formulation of Kronecker’s theory of approximation. Izv. Acad. Nauk SSSR Ser. Mat. 12, 113–122 (1948) (in Russian)

  15. Lovász, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developements and Applications, pp. 177–210. Kluwer, Norwell (1989)

    Google Scholar 

  16. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)

    Book  MATH  Google Scholar 

  17. Pokutta, S., Stauffer, G.: Lower bounds for the Chvátal–Gomory rank in the 0/1 cube. Oper. Res. Lett. 39, 200–203 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  18. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    Book  MATH  Google Scholar 

  19. Rothvoß, T., Sanità, L.: 0/1 polytopes with quadratic Chvátal rank. In: Goemans, M., Correa, J. (eds.) Proceedings of the XVI International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 7801, pp. 349–361. Springer, Heidelberg (2013)

    Google Scholar 

  20. Schrijver, A.: On cutting planes. In: Deza, M., Rosenberg, I.G. (eds.) Combinatorics 79 Part II, Annals of Discrete Mathematics 9, pp. 291–296. North-Holland, Amsterdam (1980)

    Google Scholar 

  21. Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience, New York (1986)

    MATH  Google Scholar 

Download references

Acknowledgments

Michele Conforti and Marco Di Summa acknowledge support from the Univesity of Padova (grant “Progetto di Ateneo 2013”). Yuri Faenza’s research was supported by the German Research Foundation (DFG) within the Priority Programme 1307 Algorithm Engineering. The authors are grateful to two anonymous referees, whose detailed comments helped us to improve the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Di Summa.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Conforti, M., Del Pia, A., Di Summa, M. et al. Reverse split rank. Math. Program. 154, 273–303 (2015). https://doi.org/10.1007/s10107-015-0883-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-015-0883-4

Keywords

Mathematics Subject Classification

Navigation