Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
From MaRDI portal
Publication:2482819
DOI10.1016/j.ejor.2007.06.012zbMath1146.90343OpenAlexW2037357784MaRDI QIDQ2482819
Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.012
Related Items
Optimal relay node placement in delay constrained wireless sensor network design, Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints, A branch-and-cut algorithm for the Steiner tree problem with delays, Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Optimal Network Design with End-to-End Service Requirements, A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks, A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks, A Lagrangean-based decomposition approach for the link constrained Steiner tree problem, Breakout local search for the Steiner tree problem with revenue, budget and hop constraints, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, Combinatorial optimization in system configuration design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- Multicommodity flow models for spanning trees with hop constraints
- The Steiner tree problem with hop constraints
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions
- A guide to vehicle routing heuristics
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Steiner Tree Problems With Profits
