Skip to main content
Springer Nature Link
Log in

Design and verify: a new scheme for generating cutting-planes

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

Abstract

A cutting-plane procedure for integer programming (IP) problems usually involves invoking a black-box procedure (such as the Gomory–Chvátal procedure) to compute a cutting-plane. In this paper, we describe an alternative paradigm of using the same cutting-plane black-box. This involves two steps. In the first step, we design an inequality \(cx \le d\) where \(c\) and \(d\) are integral, independent of the cutting-plane black-box. In the second step, we verify that the designed inequality is a valid inequality by verifying that the set \(P \cap \{x\in \mathbb R ^n \mid cx \ge d + 1\} \cap \mathbb Z ^n\) is empty using cutting-planes from the black-box. Here \(P\) is the feasible region of the linear-programming relaxation of the IP. We refer to the closure of all cutting-planes that can be verified to be valid using a specific cutting-plane black-box as the verification closure of the considered cutting-plane black-box. This paper undertakes a systematic study of properties of verification closures of various cutting-plane black-box procedures.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed integer 0–1 programs. Math. Program. 58, 295–324 (1993)

    Article  MATH  Google Scholar 

  2. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4, 305–337 (1973)

    Article  MATH  Google Scholar 

  3. Chvátal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114, 455–499 (1989)

    Article  MathSciNet  Google Scholar 

  4. Cook, W., Coullard, C.R., Turan, G.: On the complexity of cutting plane proof. Math. Program. 47, 11–18 (1990)

    Article  MATH  Google Scholar 

  5. Cook, W., Dash, S.: On the matrix cut rank of polyhedra. Math. Oper. Res. 26, 19–30 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Cornúejols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1–8 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cornuéjols, G., Li, Y.: On the rank of mixed 0–1 polyhedra. Math. Program. 91, 391–397 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dadush, D., Dey, S.S., Vielma, J.P.: On the Chvátal-Gomory closure of a compact convex set. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011, Proceedings Lecture Notes in Computer Science, vol. 6655, pp. 130–142. Springer, Berlin (2011)

  10. Dadush, D., Dey, S.S., Vielma, J.P.: The Chvátal-Gomory closure of strictly convex body. Math. Oper. Res. 36, 227–239 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  11. Dey, S.S., Pokutta, S.: Design and verify: a new scheme for generating cutting-planes. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011, Proceedings Lecture Notes in Computer Science, vol. 6655, pp. 143–155. Springer, Berlin (2011)

  12. Dey, S.S., Richard, J.P.P.: Some relations between facets of low- and high-dimensional group problems. Math. Program. 123, 285–313 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am Math. Soc. 64, 275–278 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lovász, L.: Geometry of numbers and integer programming. Mathematical Programming: Recent Developments and Applications (1989)

  16. Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optim. 1, 166–190 (1991)

    Article  MATH  MathSciNet  Google Scholar 

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

  18. Pokutta, S., Schulz, A.S.: Characterization of integer-free 0/1 polytopes with maximal rank (xxxx) (submitted)

  19. Pokutta, S., Schulz, A.S.: On the rank of generic cutting-plane proof systems. In: Eisenbrand, F., Shepherd, B. (eds.) Integer Programming and Combinatorial Optimization, 14th International IPCO Conference, Proceedings, Lecture Notes in Computer Science, Lausanne, Switzerland, June 9–11, 2010, pp. 450–463. Springer, Berlin (2010)

  20. Pokutta, S., Stauffer, G.: Lower bounds for the Chvátal-Gomory rank in the 0/1 cube. Oper. Res. Lett (2011) (to appear)

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

    MATH  Google Scholar 

Download references

Acknowledgments

The authors are most grateful to the anonymous referees for their detailed remarks that considerably improved the presentation and simplified some of the proofs.

Author information

Authors and Affiliations

  1. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 30332, USA

    Santanu S. Dey & Sebastian Pokutta

Authors
  1. Santanu S. Dey
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Sebastian Pokutta
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Santanu S. Dey.

Additional information

Santanu S. Dey was supported by NSF Grant CMMI1149400.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dey, S.S., Pokutta, S. Design and verify: a new scheme for generating cutting-planes. Math. Program. 145, 199–222 (2014). https://doi.org/10.1007/s10107-013-0645-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-013-0645-0

Keywords

Mathematics Subject Classification