Pages that link to "Item:Q1118419"
From MaRDI portal
The following pages link to Fast heuristic algorithms for rectilinear Steiner trees (Q1118419):
Displayed 6 items.
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)