Optimization Online


A New Second-Order Cone Programming Relaxation for MAX-CUT problems

Masakazu Muramatsu (muramatu***at***cs.uec.ac.jp)
Tsunehiro Suzuki (t-suzuki***at***eiraku.me.sophia.ac.jp)

Abstract: We propose a new relaxation scheme for the MAX-CUT problem using second-order cone programming. We construct relaxation problems to reflect the structure of the original graph. Numerical experiments show that our relaxation approaches give better bounds than those based on the spectral decomposition proposed by Kim and Kojima, and that the efficiency of the branch-and-bound method using our relaxation is comparable to that using semidefinite relaxation in some cases.

Keywords: Second-order cone programming,MAX-CUT, Primal-dual Interior-Point Method,Relaxation, Branch-and-Bound

Category 1: Combinatorial Optimization

Category 2: Linear, Cone and Semidefinite Programming

Category 3: Global Optimization (Applications )

Citation: Technical Report CS-01-01, Department of Computer Science, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, Tokyo, 182-8585 JAPAN, May 2001.

Download: [Postscript]

Entry Submitted: 05/30/2001
Entry Accepted: 05/30/2001
Entry Last Modified: 05/30/2001

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society