The following pages link to (Q3998318):
Displaying 17 items.
- An estimate of the objective function optimum for the network Steiner problem (Q271950) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← 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)
- Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph (Q2457453) (← links)
- STEINER-diagrams (Q2741322) (← links)
- Solution of the Steiner problem for convex boundaries (Q3203048) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Some generalizations of the steiner problem in graphs (Q3787806) (← links)
- Steiner problem in networks: A survey (Q3790913) (← links)
- (Q5689037) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757) (← links)