Skip to main content
SpringerLink
Log in

A Tight Semidefinite Relaxation of the MAX CUT Problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We obtain a tight semidefinite relaxation of the MAX CUT problem which improves several previous SDP relaxation in the literature. Not only is it a strict improvement over the SDP relaxation obtained by adding all the triangle inequalities to the well-known SDP relaxation, but also it satisfy Slater constraint qualification (strict feasibility).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • M. Anjos and H. Wolkowicz, “A strengthened SDP relaxation via a second lifting for the Max Cut problem,” Technical Report Research Report CORR 95-55, University of Waterloo, Waterloo, Ontario, 1999.

    Google Scholar 

  • M. Anjos and H. Wolkowicz, “A tight semidefinite relaxation of the cut polytope,” Research ReportCORR 2000-19, University of Waterloo, Waterloo, Ontario, 2000.

    Google Scholar 

  • F. Alizadeh, J.-P. Haeberly, M.V. Nayakkankuppam, M.L. Overton, and S. Schmieta, “SDPpack user's guide- version 0.9 Beta,” Technical Report TR 1997-737, Courant Institute of Mathematical Science, NYU, New York, NY, June 1997.

    Google Scholar 

  • F. Barahona, M. Grotschel, M. Junger, and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,” Operations Research, vol. 36, no. 3, pp. 493-513, 1988.

    Google Scholar 

  • F. Barahona and A.R. Mahjoub, “On the cut polytope,” Mathematical Programming, vol. 36, no. 1, pp. 157-173, 1986.

    Google Scholar 

  • M.X. Goemans and D.P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming,” Journal of the ACM, vol. 42, no. 6, pp. 1115-1145, 1995.

    Google Scholar 

  • M. Laurent, S. Poljak, and F. Rendl, “Connections between semidefinite relaxations of the max-cut and stable set problems,” Mathematical Programming, vol. 77, no. 2, pp. 225-246, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Xidian University, Xi'an, 710071, People's Republic of China

    Hongwei Liu & Sanyang Liu

  2. School of Science, Xi'an Jiaotong University, Xi'an, 710049, People's Republic of China

    Fengmin Xu

Authors
  1. Hongwei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanyang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fengmin Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, H., Liu, S. & Xu, F. A Tight Semidefinite Relaxation of the MAX CUT Problem. Journal of Combinatorial Optimization 7, 237–245 (2003). https://doi.org/10.1023/A:1027364420370

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1027364420370

Search

Navigation