A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS

スポンサーリンク

概要

• 論文の詳細を見る

• 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 gives better bounds than those based on the spectral decomposition proposed by Kim and Kojima [16], and that the efficiency of the branch-and-bound method using our relaxation is comparable to that using semidefinite relaxation in some cases.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Muramatsu Masakazu

  The University of Electro-Communications

• Muramatsu M

  The University Of Electro-communications

• Muramatsu Masakatsu

  The University of Electro-Communications

• Suzuki Tsunehiro

  Sophia University

• Suzuki T

  Sophia University

関連論文

• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
• AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(SCOPE (Seminar on Computation and OPtimization for new Extensions))
• A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS

スポンサーリンク