Pages that link to "Item:Q2482819"
From MaRDI portal
The following pages link to Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819):
Displaying 12 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
