Solving large scale Max Cut problems via tabu search

被引：0
|
作者：
Gary A. Kochenberger
Jin-Kao Hao
Zhipeng Lü
Haibo Wang
Fred Glover
机构：
[1] University of Colorado,LERIA
[2] Universite d’Angers,undefined
[3] Texas A&M International University,undefined
[4] OptTek Systems,undefined
来源：
Journal of Heuristics | 2013年 / 19卷
关键词：
Max Cut problem; Metaheuristics; Combinatorial optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In recent years many algorithms have been proposed in the literature for solving the Max-Cut problem. In this paper we report on the application of a new Tabu Search algorithm to large scale Max-cut test problems. Our method provides best known solutions for many well-known test problems of size up to 10,000 variables, although it is designed for the general unconstrained quadratic binary program (UBQP), and is not specialized in any way for the Max-Cut problem.
引用
下载
收藏
页码：565 / 571
页数：6
相关论文
共 50 条
  • [41] A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
    Alvarez-Valdés, R
    Parajón, A
    Tamarit, JM
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) : 925 - 947
  • [42] Tabu search techniques for large high-school timetabling problems
    Schaerf, A
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 363 - 368
  • [43] A Parallel Tabu Search for the Large-scale Quadratic Assignment Problem
    Abdelkafi, Omar
    Derbel, Bilel
    Liefooghe, Arnaud
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3070 - 3077
  • [44] Improved semidefinite bounding procedure for solving Max-Cut problems to optimality
    Krislock, Nathan
    Malick, Jerome
    Roupin, Frederic
    MATHEMATICAL PROGRAMMING, 2014, 143 (1-2) : 61 - 86
  • [45] Improved semidefinite bounding procedure for solving Max-Cut problems to optimality
    Nathan Krislock
    Jérôme Malick
    Frédéric Roupin
    Mathematical Programming, 2014, 143 : 61 - 86
  • [46] Max Is More than Min: Solving Maximization Problems with Heuristic Search
    Stern, Roni
    Kiesel, Scott
    Puzis, Rami
    Felner, Ariel
    Ruml, Wheeler
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4324 - 4330
  • [47] Solving zero-one mixed integer programming problems using tabu search
    Molde Coll & Res. Cent Molde, Molde, Norway
    Eur J Oper Res, 2-3 (624-658):
  • [48] Accelerating Swap-Based Tabu Search for Solving Maximum Clique Problems on FPGA
    Kanazawa, Kenji
    2019 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2019), 2019, : 1033 - 1040
  • [49] Solving zero-one mixed integer programming problems using tabu search
    Lokketangen, A
    Glover, F
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 624 - 658
  • [50] Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems
    Eswaramurthy, V. P.
    Tamilarasi, A.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (9-10): : 1004 - 1015
12345