On semidefinite programming relaxations of maximum k-section

被引：0
|
作者：
de Klerk, Etienne [1 ]
Pasechnik, Dmitrii [2 ]
Sotirov, Renata [1 ]
Dobre, Cristian [1 ]
机构：
[1] Tilburg Univ, Dept Econometr & OR, NL-5000 LE Tilburg, Netherlands
[2] Nanyang Technol Univ, Sch Phys & Math Sci, Singapore, Singapore
来源：
MATHEMATICAL PROGRAMMING | 2012年 / 136卷 / 02期
关键词：
Maximum bisection; Maximum section; Semidefinite programming; Coherent configurations; Strongly regular graph; IMPROVED APPROXIMATION ALGORITHMS; QUADRATIC ASSIGNMENT PROBLEM; GRAPH-BISECTION PROBLEMS; MAX-BISECTION; SYMMETRY; BOUNDS; CUT;
D O I：
10.1007/s10107-012-0603-2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We derive a new semidefinite programming bound for the maximum -section problem. For (i.e. for maximum bisection), the new bound is at least as strong as a well-known bound by Poljak and Rendl (SIAM J Optim 5(3):467-487, 1995). For the new bound dominates a bound of Karisch and Rendl (Topics in semidefinite and interior-point methods, 1998). The new bound is derived from a recent semidefinite programming bound by De Klerk and Sotirov for the more general quadratic assignment problem, but only requires the solution of a much smaller semidefinite program.
引用
收藏
页码：253 / 278
页数：26
相关论文
共 50 条
  • [41] FURTHER RELAXATIONS OF THE SEMIDEFINITE PROGRAMMING APPROACH TO SENSOR NETWORK LOCALIZATION
    Wang, Zizhuo
    Zheng, Song
    Ye, Yinyu
    Boyd, Stephen
    SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (02) : 655 - 673
  • [42] Exact SDP relaxations for classes of nonlinear semidefinite programming problems
    Jeyakumar, V.
    Li, G.
    OPERATIONS RESEARCH LETTERS, 2012, 40 (06) : 529 - 536
  • [43] BIQUADRATIC OPTIMIZATION OVER UNIT SPHERES AND SEMIDEFINITE PROGRAMMING RELAXATIONS
    Ling, Chen
    Nie, Jiawang
    Qi, Liqun
    Ye, Yinyu
    SIAM JOURNAL ON OPTIMIZATION, 2009, 20 (03) : 1286 - 1310
  • [44] Equality based contraction of semidefinite programming relaxations in polynomial optimization
    Vo, Cong
    Muramatsu, Masakazu
    Kojima, Masakazu
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2008, 51 (01) : 111 - 125
  • [45] New semidefinite relaxations for a class of complex quadratic programming problems
    Yingzhe Xu
    Cheng Lu
    Zhibin Deng
    Ya-Feng Liu
    Journal of Global Optimization, 2023, 87 : 255 - 275
  • [46] New semidefinite programming relaxations for box constrained quadratic program
    Xia Yong
    SCIENCE CHINA-MATHEMATICS, 2013, 56 (04) : 877 - 886
  • [47] New semidefinite programming relaxations for box constrained quadratic program
    Yong Xia
    Science China Mathematics, 2013, 56 : 877 - 886
  • [48] Semidefinite programming relaxations for graph coloring and maximal clique problems
    Igor Dukanovic
    Franz Rendl
    Mathematical Programming, 2007, 109 : 345 - 365
  • [49] Semidefinite programming relaxations for graph coloring and maximal clique problems
    Dukanovic, Igor
    Rendl, Franz
    MATHEMATICAL PROGRAMMING, 2007, 109 (2-3) : 345 - 365
  • [50] New semidefinite programming relaxations for box constrained quadratic program
    XIA Yong
    ScienceChina(Mathematics), 2013, 56 (04) : 874 - 883
12345