A combinatorial optimization algorithm for solving the branchwidth problem

被引：5
|
作者：
Smith, J. Cole [1 ]
Ulusal, Elif [2 ]
Hicks, Illya V. [3 ]
机构：
[1] Univ Florida, Gainesville, FL 32601 USA
[2] Houston Community Coll, Houston, TX USA
[3] Rice Univ, Houston, TX USA
来源：
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2012年 / 51卷 / 03期
基金：
美国国家科学基金会;
关键词：
Branch decomposition; Branchwidth; Implicit enumeration; Partitioning; DECOMPOSITIONS;
D O I：
10.1007/s10589-011-9397-z
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced by Robertson and Seymour in their series of papers that proved the Graph Minors Theorem. Branch decompositions have proven to be useful in solving many NP-hard problems, such as the traveling salesman, independent set, and ring routing problems, by means of combinatorial algorithms that operate on branch decompositions. We develop an implicit enumeration algorithm for the optimal branch decomposition problem and examine its performance on a set of classical graph instances.
引用
收藏
页码：1211 / 1229
页数：19
相关论文
共 50 条
  • [1] A combinatorial optimization algorithm for solving the branchwidth problem
    J. Cole Smith
    Elif Ulusal
    Illya V. Hicks
    Computational Optimization and Applications, 2012, 51 : 1211 - 1229
  • [2] An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem
    Yang, Jingan
    Zhuang, Yanbin
    APPLIED SOFT COMPUTING, 2010, 10 (02) : 653 - 660
  • [3] Decision solving algorithm for multiple optimal solution combinatorial optimization problem
    Hu, Zhenzhen
    Yuan, Weilin
    Luo, Junren
    Zou, Mingwo
    Chen, Jing
    Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology, 2022, 44 (03): : 31 - 40
  • [4] On solving process of a combinatorial optimization problem
    Song, Laizhong
    Zhang, Xianbo
    Yang, Wenying
    Proceedings of the Second International Conference on Game Theory and Applications, 2007, : 169 - 173
  • [5] Combinatorial genetic algorithm for solving combinatorial optimization problems
    Ou, Yongbin
    Peng, Jiahong
    Peng, Hong
    Jishou Daxue Xuebao/Journal of Jishou University, 1999, 20 (01): : 42 - 45
  • [6] Building "problem solving engines" for combinatorial optimization
    Ibaraki, T
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IX, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING: I, 2004, : 11 - 16
  • [7] Superconducting Neural Network for Solving a Combinatorial Optimization Problem
    Onomi, Takeshi
    Maenami, Yusuke
    Nakajima, Koji
    IEEE TRANSACTIONS ON APPLIED SUPERCONDUCTIVITY, 2011, 21 (03) : 701 - 704
  • [8] Building "problem solving engines" for combinatorial optimization problems
    Ibaraki, T
    INTERNATIONAL CONFERENCE ON INFORMATICS RESEARCH FOR DEVELOPMENT OF KNOWLEDGE SOCIETY INFRASTRUCTURE, PROCEEDINGS, 2004, : 187 - 193
  • [9] AN ADAPTIVE MEMBRANE ALGORITHM FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS
    He, Juanjuan
    Xiao, Jianhua
    Shao, Zehui
    ACTA MATHEMATICA SCIENTIA, 2014, 34 (05) : 1377 - 1394
  • [10] AN ADAPTIVE MEMBRANE ALGORITHM FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS
    贺娟娟
    肖建华
    邵泽辉
    Acta Mathematica Scientia, 2014, 34 (05) : 1377 - 1394
12345