Steiner tree problems with profits

被引:0
|
作者
Costa, Alysson M.
Cordeau, Jean-Francois
Laporte, Gilbert
机构
[1] HEC Montreal, Ctr Res Transportat, Montreal, PQ H3T 2A7, Canada
[2] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada
关键词
prize collecting; network design; Steiner tree problem; quota; budget; reduction tests;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when deciding which vertices should be spanned by the solution tree. The survey contains a classification of the problems falling within this category and an overview of the methods developed to solve them. It also fists several graph preprocessing procedures and analyzes their validity for the different variants of the problem. Finally, a brief comparison is made between the profit versions of the Steiner tree problem and of the travelling salesman problem.
引用
收藏
页码:99 / 115
页数:17
相关论文
共 50 条
  • [1] STEINER TREE PROBLEMS
    SMITH, WD
    SHOR, PW
    [J]. ALGORITHMICA, 1992, 7 (2-3) : 329 - 332
  • [2] STEINER TREE PROBLEMS
    HWANG, FK
    RICHARDS, DS
    [J]. NETWORKS, 1992, 22 (01) : 55 - 89
  • [3] Truthful Mechanisms for Steiner Tree Problems
    Zhang, Jinshan
    Liu, Zhengyang
    Deng, Xiaotie
    Yin, Jianwei
    [J]. THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 5, 2023, : 5884 - 5891
  • [4] On the hardness of full Steiner tree problems
    Biniaz, Ahmad
    Maheshwari, Anil
    Smid, Michiel
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2015, 34 : 118 - 127
  • [5] Online Priority Steiner Tree Problems
    Angelopoulos, Spyros
    [J]. ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 37 - 48
  • [6] 2 NEW CRITERIA FOR FINDING STEINER HULLS IN STEINER TREE PROBLEMS
    PROVAN, JS
    [J]. ALGORITHMICA, 1992, 7 (2-3) : 289 - 302
  • [7] New approximation algorithms for the Steiner tree problems
    Karpinski, M
    Zelikovsky, A
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 1997, 1 (01) : 47 - 65
  • [8] New Approximation Algorithms for the Steiner Tree Problems
    Marek Karpinski
    Alexander Zelikovsky
    [J]. Journal of Combinatorial Optimization, 1997, 1 : 47 - 65
  • [9] Bounded Degree Group Steiner Tree Problems
    Kortsarz, Guy
    Nutov, Zeev
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 343 - 354
  • [10] Solving Steiner tree problems in graphs to optimality
    Koch, T
    Martin, A
    [J]. NETWORKS, 1998, 32 (03) : 207 - 232