Solving the Steiner tree problem on a graph using branch and cut

被引：43
|
作者：
Chopra, Sunil [1 ]
Gorres, Edgar R. [1 ]
Rao, M.R. [1 ]
机构：
[1] Northwestern Univ, Evanston, United States
来源：
ORSA journal on computing | 1992年 / 4卷 / 03期
关键词：
Graph theory - Optimization - Random processes;
D O I：
10.1287/ijoc.4.3.320
中图分类号：
学科分类号：
摘要：
In this paper we report computational experience with a branch and cut solver for the Steiner tree problem on a graph. The problem instances include complete graphs, randomly generated sparse graphs and grid graphs. The edge weights are either randomly generated or are the Euclidean distance between the endnodes that are placed at random on the plane. The effect of changing various problem parameters on solution time is studied.
引用
收藏
页码：320 / 335
相关论文
共 50 条
  • [1] A branch-and-cut algorithm for the Steiner tree problem with delays
    Leggieri, V.
    Haouari, M.
    Triki, C.
    OPTIMIZATION LETTERS, 2012, 6 (08) : 1753 - 1771
  • [2] A branch-and-cut algorithm for the Steiner tree problem with delays
    V. Leggieri
    M. Haouari
    C. Triki
    Optimization Letters, 2012, 6 : 1753 - 1771
  • [3] A branch and cut algorithm for the Steiner problem in graphs
    Lucena, A
    Beasley, JE
    NETWORKS, 1998, 31 (01) : 39 - 59
  • [4] Solving the Euclidean Steiner Tree Problem Using Geometric Structures
    Seda, Milos
    MENDEL 2008, 2008, : 227 - 234
  • [5] SOLVING THE GRAPHICAL STEINER TREE PROBLEM USING GENETIC ALGORITHMS
    KAPSALIS, A
    RAYWARDSMITH, VJ
    SMITH, GD
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1993, 44 (04) : 397 - 406
  • [6] Models and Branch-and-Cut Algorithms for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
    Costa, Alysson M.
    Cordeau, Jean-Francois
    Laporte, Gilbert
    NETWORKS, 2009, 53 (02) : 141 - 159
  • [7] An improved EDA for solving Steiner tree problem
    Liu, Lei
    Wang, Hua
    Kong, Guohong
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (13): : 3483 - 3496
  • [8] Solving the Steiner Tree Problem with few Terminals
    Fichte, Johannes K.
    Hecher, Markus
    Schidler, Andre
    2020 IEEE 32ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2020, : 293 - 300
  • [9] Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
    Bomze, Immanuel
    Chimani, Markus
    Juenger, Michael
    Ljubic, Ivana
    Mutzel, Petra
    Zey, Bernd
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 427 - +
  • [10] On the bidirected cut relaxation for the metric Steiner tree problem
    Rajagopalan, S
    Vazirani, VV
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 742 - 751
12345