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

DOI10.1016/J.EJOR.2010.03.027zbMATH Open1205.90068OpenAlexW2092639277MaRDI QIDQ992574FDOQ992574

Authors: Leizer Lima Pinto, G. 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

Recommendations

• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• scientific article; zbMATH DE number 139910
• The Steiner tree problem
• scientific article; zbMATH DE number 3918122
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

zbMATH Keywords

Steiner treemulti-objective problemPareto-optimal solutionbottleneck function

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
• Maximizing the net present value of a Steiner tree

This page was built for publication: An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992574)