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 条
  • [31] Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms
    Li, Xiangyong
    Aneja, Y. R.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (01) : 25 - 40
  • [32] On distributed solving of the capacitated vehicle routing problem with branch-and-cut algorithms
    Botincan, M
    Nogo, G
    SOR 05 Proceedings, 2005, : 345 - 350
  • [33] Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
    Duchenne, T
    Laporte, G
    Semet, F
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (03) : 700 - 712
  • [34] Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression
    Salazar-Gonzalez, Juan-Jose
    PRIVACY IN STATISTICAL DATABASES, 2010, 6344 : 29 - 40
  • [35] Branch-and-cut algorithm for the equicut problem
    Universita degli Studi di Padova, Padova, Italy
    Math Program Ser B, 2 (243-263):
  • [36] Models and branch-and-cut algorithms for pickup and delivery problems with time windows
    Ropke, Stefan
    Cordeau, Jean-Francois
    Laporte, Gilbert
    NETWORKS, 2007, 49 (04) : 258 - 272
  • [37] A branch-and-cut algorithm for the equicut problem
    Brunetta, L
    Conforti, M
    Rinaldi, G
    MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 243 - 263
  • [38] A branch-and-cut algorithm for the equicut problem
    Lorenzo Brunetta
    Michele Conforti
    Giovanni Rinaldi
    Mathematical Programming, 1997, 78 : 243 - 263
  • [39] Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
    Pereira, Dilson Lucas
    da Cunha, Alexandre Salles
    NETWORKS, 2018, 71 (01) : 31 - 50
  • [40] Declawing a graph: polyhedra and Branch-and-Cut algorithms
    Felipe C. Fragoso
    Gilberto F. de Sousa Filho
    Fábio Protti
    Journal of Combinatorial Optimization, 2021, 42 : 85 - 124
12345