THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5

被引:85
|
作者
BARAHONA, F [1 ]
机构
[1] UNIV BONN,INST OPERAT RES,D-5300 BONN 1,FED REP GER
关键词
D O I
10.1016/0167-6377(83)90016-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:107 / 111
页数:5
相关论文
共 50 条
  • [21] Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
    Eunok Bae
    Soojoon Lee
    [J]. Quantum Information Processing, 23
  • [22] A POLYNOMIAL ALGORITHM FOR THE MAX-CUT PROBLEM ON GRAPHS WITHOUT LONG ODD CYCLES
    GROTSCHEL, M
    NEMHAUSER, GL
    [J]. MATHEMATICAL PROGRAMMING, 1984, 29 (01) : 28 - 40
  • [23] A hierarchical social metaheuristic for the Max-Cut problem
    Duarte, A
    Fernández, F
    Sánchez, A
    Sanz, A
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3004 : 84 - 94
  • [24] Breakout Local Search for the Max-Cut problem
    Benlic, Una
    Hao, Jin-Kao
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (03) : 1162 - 1173
  • [25] On greedy construction heuristics for the MAX-CUT problem
    Kahruman, Sera
    Kolotoglu, Elif
    Butenko, Sergiy
    Hicks, Illya V.
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2007, 3 (03) : 211 - 218
  • [26] SOLVING THE MAX-CUT PROBLEM USING EIGENVALUES
    POLJAK, S
    RENDL, F
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 62 (1-3) : 249 - 278
  • [27] Improved approximation of Max-Cut on graphs of bounded degree
    Feige, U
    Karpinski, M
    Langberg, M
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 43 (02): : 201 - 219
  • [28] NODE AND EDGE RELAXATIONS OF THE MAX-CUT PROBLEM
    POLJAK, S
    RENDL, F
    [J]. COMPUTING, 1994, 52 (02): : 123 - 137
  • [29] Advanced Scatter Search for the Max-Cut Problem
    Marti, Rafael
    Duarte, Abraham
    Laguna, Manuel
    [J]. INFORMS JOURNAL ON COMPUTING, 2009, 21 (01) : 26 - 38
  • [30] Intractability of min- and max-cut in streaming graphs
    Zelke, Mariano
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (03) : 145 - 150