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 条
  • [41] Rearrangement of DNA fragments: a branch-and-cut algorithms
    Ferreira, CE
    de Souza, CC
    Wakabayashi, Y
    DISCRETE APPLIED MATHEMATICS, 2002, 116 (1-2) : 161 - 177
  • [42] A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
    Gelareh, Shahin
    Monemi, Rahimeh Neamatian
    Semet, Frederic
    Goncalves, Gilles
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (03) : 1144 - 1152
  • [43] Declawing a graph: polyhedra and Branch-and-Cut algorithms
    Fragoso, Felipe C.
    de Sousa Filho, Gilberto F.
    Protti, Fabio
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (01) : 85 - 124
  • [44] Polyhedral results and a Branch-and-cut algorithm for the k-cardinality tree problem
    Simonetti, Luidi
    da Cunha, Alexandre Salles
    Lucena, Abilio
    MATHEMATICAL PROGRAMMING, 2013, 142 (1-2) : 511 - 538
  • [45] The Generalized Minimum Spanning Tree Problem:: Polyhedral analysis and branch-and-cut algorithm
    Feremans, C
    Labbé, M
    Laporte, G
    NETWORKS, 2004, 43 (02) : 71 - 86
  • [46] 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 - +
  • [47] The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms
    Barbato, Michele
    Gouveia, Luis
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 316 (02) : 473 - 487
  • [48] A branch-and-cut algorithm for the Winner Determination Problem
    Escudero, Laureano F.
    Landete, Mercedes
    Marin, Alfredo
    DECISION SUPPORT SYSTEMS, 2009, 46 (03) : 649 - 659
  • [49] A branch-and-cut algorithm for an assembly routing problem
    Chitsaz, Masoud
    Cordeau, Jean-Francois
    Jans, Raf
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) : 896 - 910
  • [50] A branch-and-cut algorithm for the preemptive swapping problem
    Bordenave, Charles
    Gendreau, Michel
    Laporte, Gilbert
    NETWORKS, 2012, 59 (04) : 387 - 399
12345