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 条

[21] A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the Steiner tree problem with revenue, budget and hop constraints
Tansel Dokeroglu
Erhan Mengusoglu
Soft Computing, 2018, 22 : 4133 - 4151
[22] Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
Gouveia, Luis
Paias, Ana
Sharma, Dushyant
JOURNAL OF HEURISTICS, 2011, 17 (01) : 23 - 37
[23] Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
Luis Gouveia
Ana Paias
Dushyant Sharma
Journal of Heuristics, 2011, 17 : 23 - 37
[24] Low-Cost Two-Hop Anchor Node-Based Distributed Range-Free Localization in Wireless Sensor Networks
Kim, Taeyoung
Shon, Minhan
Choi, Wook
Song, MoonBae
Choo, Hyunseung
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2010, PT 3, PROCEEDINGS, 2010, 6018 : 129 - +
[25] New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
Akgun, Ibrahim
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) : 277 - 286
[26] A flexible tree-based routing protocol with a mesh relaying node in multi-hop wireless mesh networks
Kim, Hyun-Ki
Lee, Tae-Jin
WIRED/WIRELESS INTERNET COMMUNICATIONS, PROCEEDINGS, 2007, 4517 : 326 - +
[27] VNS-Based Matheuristic Approach to Group Steiner Tree with Problem-Specific Node Release Strategy
Davidovic, Tatjana
Jelic, Slobodan
METAHEURISTICS, MIC 2024, PT I, 2024, 14753 : 344 - 358
[28] Controller node driven hop count based data distribution algorithm in ring connected binary tree network-on-chip for parallel processing
Uma R.
Sarojadevi H.
Sanju V.
International Journal of Information Technology, 2024, 16 (4) : 2535 - 2547

← 1 2 3 →