Models and Branch-and-Cut Algorithms for the Steiner Tree Problem with Revenues, Budget and Hop Constraints

被引：32

作者：

Costa, Alysson M. ^{[1
]}

Cordeau, Jean-Francois ^{[1
]}

Laporte, Gilbert ^{[1
]}

机构：

[1] HEC Montreal, Montreal, PQ H3T 2A7, Canada

来源：

NETWORKS | 2009年 / 53卷 / 02期

关键词：

prize collecting; network design; Steiner tree problem; budget; branch-and-cut; hop constraints; MINIMAL TREES; GRAPHS; FORMULATIONS; FACETS; REQUIREMENTS; POLYHEDRA; POLYTOPE;

D O I：

10.1002/net.20274

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Steiner tree problem with revenues, budget and hop constraints is a variant of the Steiner tree problem with two main modifications: (a) besides the costs associated with arcs, there are also revenues associated with the vertices, and (b) there are additional budget and hop constraints, which impose limits on the total cost of the network and on the number of edges between any vertex and the root, respectively. This article introduces and compares several mathematical models for this problem and describes two branch-and-cut algorithms, which solve to optimality instances with up to 500 vertices and 625 edges. (C) 2008 Wiley Periodicals, Inc. NETWORKS, Vol. 53(2), 141-159 2009

引用

页码：141 / 159

页数：19

共 50 条

[1] 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
[2] 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,
[3] 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
[4] 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
[5] A branch-and-cut algorithm for the Steiner tree problem with delays
V. Leggieri
M. Haouari
C. Triki
Optimization Letters, 2012, 6 : 1753 - 1771
[6] Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts
Hill, Alessandro
Voss, Stefan
Baldacci, Roberto
COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 266 - 278
[7] Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
Fu, Zhang-Hua
Hao, Jin-Kao
INFORMS JOURNAL ON COMPUTING, 2015, 27 (02) : 221 - 237
[8] The rank pricing problem: Models and branch-and-cut algorithms
Calvete, Herminia, I
Dominguez, Concepcion
Gale, Carmen
Labbe, Martine
Marin, Alfredo
COMPUTERS & OPERATIONS RESEARCH, 2019, 105 : 12 - 31
[9] 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
[10] The Steiner tree problem with hop constraints
S. Voß
Annals of Operations Research, 1999, 86 : 321 - 345

← 1 2 3 4 5 →