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 条
  • [41] GLS Optimization Algorithm for Solving Travelling Salesman Problem
    Neissi, Nourolhoda Alemi
    Mazloom, Masoud
    SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 291 - +
  • [42] Hybrid ITO Algorithm for Solving Numerical Optimization Problem
    Yi, Yunfei
    Lin, Xiaodong
    Sheng, Kang
    Jiang, Lin
    Dong, Wenyong
    Cai, Yongle
    INTELLIGENT COMPUTING THEORY, 2014, 8588 : 21 - 31
  • [43] A Genetic Algorithm Used for Solving One Optimization Problem
    Shipacheva, E. N.
    Petunin, A. A.
    Berezin, I. M.
    MECHANICS, RESOURCE AND DIAGNOSTICS OF MATERIALS AND STRUCTURES (MRDMS-2017), 2017, 1915
  • [44] A global optimization algorithm for solving linear programming problem
    Cavalcante, JRR
    de Souza, FMC
    MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 513 - 515
  • [45] On ant colony algorithm for solving continuous optimization problem
    Li Hong
    Xiong Shibo
    2008 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2008, : 1450 - 1453
  • [46] Solving Redundancy Optimization Problem with a New Stochastic Algorithm
    Yang, Chun-Xia
    Cui, Zhi-Hua
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT II, 2011, 7077 : 132 - 139
  • [47] An imperialist competitive algorithm for solving constrained optimization problem
    Lei D.-M.
    Cao S.-Q.
    Li M.
    Kongzhi yu Juece/Control and Decision, 2019, 34 (08): : 1663 - 1671
  • [48] Differential Evolution Algorithm for Solving the Portfolio Optimization Problem
    Homchenko, A. A.
    Grishina, N. P.
    Lucas, C.
    Sidorov, S. P.
    IZVESTIYA SARATOVSKOGO UNIVERSITETA NOVAYA SERIYA-MATEMATIKA MEKHANIKA INFORMATIKA, 2013, 13 (02): : 16 - 16
  • [49] Solving a dynamic routing problem using an optimization algorithm
    Lebedeva, O. A.
    Poltavskaya, J. O.
    Gozbenko, V
    Mikhailov, A.
    INTERNATIONAL SCIENTIFIC CONFERENCE ENERGY MANAGEMENT OF MUNICIPAL FACILITIES AND SUSTAINABLE ENERGY TECHNOLOGIES, 2020, 1614
  • [50] Research on an Intelligent Optimization Algorithm for Combinatorial Optimization Problem Based on Big Data
    Zhang, Xuecong
    2020 INTERNATIONAL CONFERENCE ON BIG DATA & ARTIFICIAL INTELLIGENCE & SOFTWARE ENGINEERING (ICBASE 2020), 2020, : 386 - 389
12345