A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints

被引：1
|
作者：
Fortz, Bernard [1 ,2 ]
Gouveia, Luis [3 ,4 ]
Moura, Pedro [3 ,4 ]
机构：
[1] Univ Libre Bruxelles ULB, Comp Sci Dept, Brussels, Belgium
[2] INRIA Lille Nord Europe, INOCS, Villeneuve Dascq, France
[3] Univ Lisbon, Fac Ciencias, Dept Estat & Invest Operac, Lisbon, Portugal
[4] CMAFcIO Ctr Matemat Aplicacoes Fundamentais & Inv, Lisbon, Portugal
来源：
NETWORKS | 2022年 / 80卷 / 02期
关键词：
hop constraint; hop-indexed model; integer programming; linear programming relaxation; network design; Steiner tree; SURVIVABLE NETWORK DESIGN; REVENUES; BUDGET; MODELS;
D O I：
10.1002/net.22086
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the relation between the linear programming relaxation of two classes of models for the Steiner tree problem with hop constraints. One class is characterized by having hop-indexed arc variables. Although such models have proved to have a very strong linear programming bound, they are not easy to use because of the huge number of variables. This has motivated some studies with models involving fewer variables that use, instead of the hop-indexed arc variables, hop-indexed node variables. In this article, we contextualize the linear programming relaxation of these node-based models in terms of the linear programming relaxation of known arc-based models. We show that the linear programming relaxation of a general node-based model is implied by the linear programming relaxation of a straightforward arc-based model.
引用
收藏
页码：178 / 192
页数：15
相关论文
共 28 条
  • [1] The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
    Gouveia, L
    Martins, P
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (09) : 2435 - 2452
  • [2] A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
    Sinnl M.
    Ljubić I.
    Sinnl, Markus (markus.sinnl@univie.ac.at), 1600, Springer Verlag (08): : 461 - 490
  • [3] The Steiner tree problem with hop constraints
    S. Voß
    Annals of Operations Research, 1999, 86 : 321 - 345
  • [4] The Steiner tree problem with hop constraints
    Voss, S
    ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 321 - 345
  • [5] The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model
    Gouveia, L
    Martins, P
    ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 271 - 294
  • [6] A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
    Gouveia, L
    Martins, P
    NETWORKS, 2000, 35 (01) : 1 - 16
  • [7] Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
    Costa, Alysson M.
    Cordeau, Jean-Francois
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (01) : 68 - 78
  • [8] Solving the Steiner Tree Problem with Revenues, Budget and Hop Constraints to optimality
    Layeb, Safa Bhar
    Hajri, Ines
    Haouari, Mohamed
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [9] Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
    Fu, Zhang-Hua
    Hao, Jin-Kao
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (01) : 209 - 233
  • [10] A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
    Jabrayilov, Adalat
    Mutzel, Petra
    2019 PROCEEDINGS OF THE MEETING ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2019, : 107 - 116
123