The following pages link to (Q3998318):
Displaying 8 items.
- Looking ahead with the pilot method (Q816423) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- Steiner's problem in double trees (Q1861809) (← links)
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic (Q2260900) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757) (← links)
