An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions

DOI10.1016/j.ejor.2010.03.027zbMath1205.90068OpenAlexW2092639277MaRDI QIDQ992574

Leizer Lima Pinto, Gilbert Laporte

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.027

zbMATH Keywords

Steiner treemulti-objective problemPareto-optimal solutionbottleneck function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization

Cites Work

• Unnamed Item
• Unnamed Item
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
• Multicommodity flow models for spanning trees with hop constraints
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Algorithms for two bottleneck optimization problems
• An SST-based algorithm for the steiner problem in graphs
• An integer linear programming approach to the steiner problem in graphs
• The Complexity of Computing Steiner Minimal Trees
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Variations of the prize‐collecting Steiner tree problem
• Steiner's problem in graphs and its implications
• Steiner Tree Problems With Profits