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 条
  • [21] On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
    Ding, Yichuan
    Ge, Dongdong
    Wolkowicz, Henry
    MATHEMATICS OF OPERATIONS RESEARCH, 2011, 36 (01) : 88 - 104
  • [22] Relaxations of the Satisfiability Problem Using Semidefinite Programming
    Etienne de Klerk
    Hans van Maaren
    Joost P. Warners
    Journal of Automated Reasoning, 2000, 24 : 37 - 65
  • [23] Properties of dimension witnesses and their semidefinite programming relaxations
    Mironowicz, Piotr
    Li, Hong-Wei
    Pawlowski, Marcin
    PHYSICAL REVIEW A, 2014, 90 (02):
  • [24] Semidefinite programming vs. LP relaxations for polynomial programming
    Lasserre, JB
    MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (02) : 347 - 360
  • [25] K-SECTION OF A TYPE-N OBJECT
    SACKS, GE
    AMERICAN JOURNAL OF MATHEMATICS, 1977, 99 (05) : 901 - 917
  • [26] On Semidefinite Programming Relaxations of (2+p)-SAT
    E. de Klerk
    H. van Maaren
    Annals of Mathematics and Artificial Intelligence, 2003, 37 : 285 - 305
  • [27] Semidefinite relaxations for semi-infinite polynomial programming
    Wang, Li
    Guo, Feng
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 58 (01) : 133 - 159
  • [28] The power of Semidefinite Programming relaxations for MAX-SAT
    Gomes, Carla P.
    van Hoeve, Willem-Jan
    Leahu, Lucian
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2006, 3990 : 104 - 118
  • [29] Semidefinite relaxations for semi-infinite polynomial programming
    Li Wang
    Feng Guo
    Computational Optimization and Applications, 2014, 58 : 133 - 159
  • [30] SEMIDEFINITE PROGRAMMING RELAXATIONS FOR LINEAR SEMI-INFINITE POLYNOMIAL PROGRAMMING
    Guo, Feng
    Sun, Xiaoxia
    PACIFIC JOURNAL OF OPTIMIZATION, 2020, 16 (03): : 395 - 418
12345