Skip to main content
SpringerLink
Log in

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm

  • Conference paper
Book cover Combinatorial Optimization (ISCO 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7422))

Included in the following conference series:

Abstract

Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequalities, which include many other known inequalities as special cases. The gap inequalities have received little attention and are poorly understood. This paper presents the first ever computational results. In particular, we describe heuristic separation algorithms for gap inequalities and their special cases, and show that an LP-based cutting-plane algorithm based on these separation heuristics can yield very good upper bounds in practice.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avis, D.: On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 51–59. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Avis, D., Umemoto, J.: Stronger linear programming relaxations of max-cut. Math. Program. 97, 451–469 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157–173 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Meth. & Software 11, 613–623 (1999)

    Article  MathSciNet  Google Scholar 

  5. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

  6. Deza, M.: On the Hamming geometry of unitary cubes. Soviet Physics Doklady 5, 940–943 (1961)

    Google Scholar 

  7. Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Berlin (1997)

    MATH  Google Scholar 

  8. Galli, L., Letchford, A.N.: Small bipartite subgraph polytopes. Oper. Res. Lett. 38(5), 337–340 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Galli, L., Kaparis, K., Letchford, A.N.: Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39(5), 297–300 (2011)

    MathSciNet  MATH  Google Scholar 

  10. Galli, L., Kaparis, K., Letchford, A.N.: Complexity results for the gap inequalities for the max-cut problem. To appear in Oper. Res. Lett (2011)

    Google Scholar 

  11. Giandomenico, M., Letchford, A.N.: Exploring the relationship between max-cut and stable set relaxations. Math. Program. 106, 159–175 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Ass. Comp. Mach. 42, 1115–1145 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Helmberg, C., Rendl, F.: Solving quadratic (0,1)-programs by semidefinite programs and cutting planes. Math. Program. 82, 291–315 (1998)

    MathSciNet  MATH  Google Scholar 

  14. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  15. Kelly, J.B.: Hypermetric spaces. In: The Geometry of Metric and Linear Spaces. Lecture Notes in Mathematics, vol. 490, pp. 17–31. Springer, Berlin (1974)

    Chapter  Google Scholar 

  16. Laurent, M.: Max-cut problem. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 241–259. Wiley, Chichester (1997)

    Google Scholar 

  17. Laurent, M., Poljak, S.: On a positive semidefinite relaxation of the cut polytope. Lin. Alg. Appl. 223/224, 439–461 (1995)

    Article  MathSciNet  Google Scholar 

  18. Laurent, M., Poljak, S.: Gap inequalities for the cut polytope. SIAM Journal on Matrix Analysis 17, 530–547 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  19. Letchford, A.N., Sørensen, M.M.: Binary Positive Semidefinite Matrices and Associated Integer Polytopes. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 125–139. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Marsten, R.E., Hogan, W.W., Blankenship, J.W.: The BOXSTEP method for large-scale optimization. Oper. Res. 23, 389–405 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  21. Poljak, S., Rendl, F.: Nonpolyhedral relaxations of graph bisection problems. SIAM J. on Opt. 5, 467–487 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Poljak, S., Tuza, Z.: Maximum cuts and large bipartite subgraphs. In: Cook, W., Lovász, L., Seymour, P. (eds.) Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 181–244. American Mathematical Society (1995)

    Google Scholar 

  23. Qualizza, A., Belotti, P., Margot, F.: Linear programming relaxations of quadratically constrained quadratic programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. IMA Volumes in Mathematics and its Applications, vol. 154, pp. 407–426. Springer, Berlin (2012)

    Chapter  Google Scholar 

  24. Schoenberg, I.J.: Metric spaces and positive definite functions. Trans. Amer. Math. Soc. 44, 522–536 (1938)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warwick Business School, University of Warwick, United Kingdom

    Laura Galli

  2. Department of Management Science, Lancaster University, United Kingdom

    Konstantinos Kaparis & Adam N. Letchford

Authors
  1. Laura Galli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos Kaparis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adam N. Letchford
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    A. Ridha Mahjoub  & Vangelis Th. Paschos  & 

  2. Department of Informatics, Athens University of Economics and Business, 76 Patission str., 10434, Athens, Greece

    Vangelis Markakis  & Ioannis Milis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galli, L., Kaparis, K., Letchford, A.N. (2012). Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation