Complexity results for the gap inequalities for the max-cut problem

被引：1

作者：

Galli, Laura ^{[2
]}

Kaparis, Konstantinos ^{[1
]}

Letchford, Adam N. ^{[1
]}

机构：

[1] Univ Lancaster, Dept Management Sci, Lancaster LA1 4YW, England

[2] Univ Bologna, DEIS, I-40136 Bologna, Italy

来源：

OPERATIONS RESEARCH LETTERS | 2012年 / 40卷 / 03期

基金：

英国工程与自然科学研究理事会;

关键词：

Computational complexity; Max-cut problem; Cutting planes; RELAXATIONS; POLYTOPE; SET;

D O I：

10.1016/j.orl.2012.01.010

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We prove several complexity results about the gap inequalities for the max-cut problem, including (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP = Co NP; (ii) there must exist non-redundant gap inequalities with exponentially large coefficients, unless NP = Co NP: (iii) the associated separation problem can be solved in finite (doubly exponential) time. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：149 / 152

页数：4

共 50 条

[1] Gap inequalities for the max-cut problem: A cutting-plane algorithm
Galli, Laura
Kaparis, Konstantinos
Letchford, Adam N.
[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7422 LNCS : 178 - 188
[2] Generalised 2-circulant inequalities for the max-cut problem
Kaparis, Konstantinos
Letchford, Adam N.
Mourtos, Ioannis
[J]. OPERATIONS RESEARCH LETTERS, 2022, 50 (02) : 122 - 128
[3] A note on the 2-circulant inequalities for the max-cut problem
Kaparis, Konstantinos
Letchford, Adam N.
[J]. OPERATIONS RESEARCH LETTERS, 2018, 46 (04) : 443 - 447
[4] EIGENVALUES AND THE MAX-CUT PROBLEM
MOHAR, B
POLJAK, S
[J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1990, 40 (02) : 343 - 352
[5] 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
[6] 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
[7] Randomized heuristics for the MAX-CUT problem
Festa, P
Pardalos, PM
Resende, MGC
Ribeiro, CC
[J]. OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (06): : 1033 - 1058
[8] COMBINATORIAL PROPERTIES AND THE COMPLEXITY OF A MAX-CUT APPROXIMATION
DELORME, C
POLJAK, S
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 1993, 14 (04) : 313 - 333
[9] A Continuation Algorithm for Max-Cut Problem
Feng Min XU
Cheng Xian XU
Xing Si LI
[J]. Acta Mathematica Sinica,English Series, 2007, 23 (07) : 1257 - 1264
[10] A Continuation Algorithm for Max-Cut Problem
Feng Min Xu
Cheng Xian Xu
Xing Si Li
[J]. Acta Mathematica Sinica, English Series, 2007, 23 : 1257 - 1264

← 1 2 3 4 5 →