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 条
  • [21] Solving combinatorial optimization problems using Karmarkar's algorithm
    Mitchell, John E.
    Todd, Michael J.
    Mathematical Programming, Series B, 1992, 56 (01): : 245 - 284
  • [22] Improved quantum evolutionary algorithm for combinatorial optimization problem
    Zhang, Rui
    Gao, Hui
    PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 3501 - +
  • [23] Study on a novel genetic algorithm for the combinatorial optimization problem
    Dang, Jian-wu
    Wang, Yang-ping
    Zhao, Shu-xu
    2007 INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS, VOLS 1-6, 2007, : 1377 - 1380
  • [24] Extremal optimization algorithm for dynamic combinatorial auction problem
    Qi, Jie
    Zheng, Min-Nan
    Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology, 2009, 33 (SUPPL. 1): : 47 - 52
  • [25] A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
    Cui, Tianxiang
    Cheng, Shi
    Bai, Ruibin
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 491 - 498
  • [26] Hybrid Quantum Particle Swarm Optimization Algorithm for Combinatorial Optimization Problem
    Wang, Jiahai
    Zhou, Yalan
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 185 - 185
  • [27] Solving combinatorial optimization problem using Quantum-Behaved Particle Swarm Optimization
    Tian, Na
    Sun, Jun
    Xu, Wenbo
    DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 491 - 493
  • [28] A dual-based combinatorial algorithm for solving cyclic optimization problems
    Alfares, Hesham K.
    Recent Patents on Computer Science, 2012, 5 (03): : 188 - 196
  • [29] Solving combinatorial optimization problems with line-up competition algorithm
    Yan, LX
    COMPUTERS & CHEMICAL ENGINEERING, 2003, 27 (02) : 251 - 258
  • [30] The Power of Human-Algorithm Collaboration in Solving Combinatorial Optimization Problems
    Toivonen, Tapani
    Tukiainen, Markku
    ALGORITHMS, 2021, 14 (09)
12345