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 条

[1] Semidefinite programming relaxations for quantum correlations
Tavakoli, Armin
Pozas-Kerstjens, Alejandro
Brown, Peter
Araújo, Mateus
Reviews of Modern Physics, 2024, 96 (04)
[2] On semidefinite programming relaxations for the satisfiability problem
Miguel F. Anjos
Mathematical Methods of Operations Research, 2004, 60 : 349 - 367
[3] Semidefinite programming relaxations for semialgebraic problems
Parrilo, PA
MATHEMATICAL PROGRAMMING, 2003, 96 (02) : 293 - 320
[4] ON DOUBLY POSITIVE SEMIDEFINITE PROGRAMMING RELAXATIONS
Fu, Taoran
Ge, Dongdong
Ye, Yinyu
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2018, 36 (03) : 391 - 403
[5] Exploiting semidefinite relaxations in constraint programming
van Hoeve, WJ
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (10) : 2787 - 2804
[6] On semidefinite programming relaxations for the satisfiability problem
Anjos, MF
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2004, 60 (03) : 349 - 367
[7] Semidefinite programming relaxations for semialgebraic problems
Pablo A. Parrilo
Mathematical Programming, 2003, 96 : 293 - 320
[8] Semidefinite programming relaxations and algebraic optimization in control
Parrilo, PA
Lall, S
EUROPEAN JOURNAL OF CONTROL, 2003, 9 (2-3) : 307 - 321
[9] On linear and semidefinite programming relaxations for hypergraph matching
Chan, Yuk Hei
Lau, Lap Chi
MATHEMATICAL PROGRAMMING, 2012, 135 (1-2) : 123 - 148
[10] Semidefinite programming relaxations for the graph partitioning problem
Wolkowicz, Henry
Zhao, Qing
Discrete Applied Mathematics, 1999, 96-97 : 461 - 479

← 1 2 3 4 5 →