Rank of Handelman hierarchy for Max-Cut

被引：3
|
作者：
Park, Myoung-Ju [1 ]
Hong, Sung-Pil [1 ]
机构：
[1] Seoul Natl Univ, Dept Ind Engn, Seoul 151742, South Korea
来源：
OPERATIONS RESEARCH LETTERS | 2011年 / 39卷 / 05期
基金：
新加坡国家研究基金会;
关键词：
Polynomial optimization; Rank of hierarchical relaxation; Handelman hierarchy; Max-Cut; RLT; LOVASZ-SCHRIJVER; SHERALI-ADAMS; RELAXATIONS; OPTIMIZATION; POLYNOMIALS; MATRICES;
D O I：
10.1016/j.orl.2011.07.006
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider a hierarchical relaxation, called Handelman hierarchy, for a class of polynomial optimization problems. We prove that the rank of Handelman hierarchy, if applied to a standard quadratic formulation of Max-Cut, is exactly the same as the number of nodes of the underlying graph. Also we give an error bound for Handelman hierarchy, in terms of its level, applied to the Max-Cut formulation. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：323 / 328
页数：6
相关论文
共 50 条
  • [1] Graphs with a small max-cut
    Delorme, C
    Favaron, O
    [J]. UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
  • [2] Semidefinite relaxations for max-cut
    Laurent, M
    [J]. THE SHARPEST CUT: THE IMPACT OF MANFRED PADBERG AND HIS WORK, 2004, 4 : 257 - 290
  • [3] MAX-CUT IN CIRCULANT GRAPHS
    POLJAK, S
    TURZIK, D
    [J]. DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
  • [4] EIGENVALUES AND THE MAX-CUT PROBLEM
    MOHAR, B
    POLJAK, S
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1990, 40 (02) : 343 - 352
  • [5] On the max-cut of sparse random graphs
    Gamarnik, David
    Li, Quan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 219 - 262
  • [6] A memetic algorithm for the max-cut problem
    Lin, Geng
    Zhu, Wenxing
    [J]. INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2015, 6 (01) : 69 - 77
  • [7] A continuation algorithm for max-cut problem
    Xu, Feng Min
    Xu, Cheng Xian
    Li, Xing Si
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2007, 23 (07) : 1257 - 1264
  • [8] MAX-CUT on Samplings of Dense Graphs
    Fakcharoenphol, Jittat
    Vajanopath, Phanu
    [J]. 2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,
  • [9] Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
    Burer, S
    Monteiro, RDC
    Zhang, Y
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (02) : 503 - 521
  • [10] MAX-CUT and Containment Relations in Graphs
    Kaminski, Marcin
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 15 - 26
12345