A novel formulation of the max-cut problem and related algorithm

Abstract In this paper, a new formulation of the max-cut problem is proposed. Several semidefinite programming(SDP) relaxations of the max-cut problem are given and some relationships between them are put forward. Based on a new SDP relaxation, an algorithm is presented for finding a better approximate solution of the max-cut problem and we show the advantages of our model and algorithm with several examples.

[1]  Dachuan Xu,et al.  Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation , 2007 .

[2]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[3]  Uriel Feige,et al.  On the optimality of the random hyperplane rounding technique for MAX CUT , 2002, Random Struct. Algorithms.

[4]  F. Rendl.  Semidefinite programming and combinatorial optimization , 1999 .

[5]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[6]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[7]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[8]  Kim-Chuan Toh,et al.  SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) , 2017, Optim. Methods Softw..

[9]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[10]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[11]  Shuzhong Zhang,et al.  Quadratic maximization and semidefinite relaxation , 2000, Math. Program..

[12]  M. Goemans.  Semidefinite programming and combinatorial optimization , 1998 .

[13]  Robert J. Vanderbei,et al.  An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..

[14]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[15]  C. Helmberg.  Semidefinite Programming for Combinatorial Optimization , 2000 .