Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems

Many combinatorial optimization problems have relaxations that are semidefinite programming problems. In principle, the combinatorial optimization problem can then be solved by using a branch-and-cut procedure, where the problems to be solved at the nodes of the tree are semidefinite programs. It is desirable that the solution to one node of the tree should be exploited at the child node in order to speed up the solution of the child. We show how the solution to the parent relaxation can be used as a warm start to construct an appropriate initial dual solution to the child problem. This restart method for SDP branch-and-cut can be regarded as analogous to the use of the dual simplex method in the branch-and-cut method for mixed integer linear programming problems.

[1]  C. Helmberg,et al.  Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .

[2]  Christoph Helmberg,et al.  Fixing Variables in Semidefinite Relaxations , 1997, ESA.

[3]  John E. Mitchell,et al.  Solving MAX-SAT and weighted MAX-SAT problems using branch-and-cut , 1998 .

[4]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

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

[6]  S. Benson,et al.  Mixed linear and semidefinite programming for combinatorial and quadratic optimization , 1999 .

[7]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[8]  Franz Rendl,et al.  Nonpolyhedral Relaxations of Graph-Bisection Problems , 1995, SIAM J. Optim..

[9]  Michel X. Goemans,et al.  Semideenite Programming in Combinatorial Optimization , 1999 .

[10]  David Abramson,et al.  A Parallel Interior Point Method and Its Application to Facility Location Problems , 1998, Comput. Optim. Appl..

[11]  Franz Rendl,et al.  Combining Semidefinite and Polyhedral Relaxations for Integer Programs , 1995, IPCO.

[12]  Shinji Hara,et al.  Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..

[13]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

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

[15]  Eva K. Lee,et al.  COMPUTATIONAL EXPERIENCE OF AN INTERIOR-POINT SQP ALGORITHM IN A PARALLEL BRANCH-AND-BOUND FRAMEWORK , 2000 .

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