A New Second-Order Cone Programming Relaxation for MAX-CUT problems
Masakazu Muramatsu (muramatucs.uec.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.
Entry Submitted: 05/30/2001
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|