Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
From MaRDI portal
Publication:2482819
Recommendations
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- The Steiner tree problem with hop constraints
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 5070513 (Why is no real title available?)
- A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A general heuristic for vehicle routing problems
- A guide to vehicle routing heuristics
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A unified heuristic for a large class of vehicle routing problems with backhauls
- 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
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Multicommodity flow models for spanning trees with hop constraints
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions
- Steiner Tree Problems With Profits
- The Steiner tree problem with hop constraints
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
Cited in
(16)- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
- A branch-and-cut algorithm for the Steiner tree problem with delays
- Optimal relay node placement in delay constrained wireless sensor network design
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Combinatorial optimization in system configuration design
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Optimal network design with end-to-end service requirements
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Steiner Tree Problems With Profits
This page was built for publication: Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482819)
