Pages that link to "Item:Q1265187"
From MaRDI portal
The following pages link to Two heuristics for the Euclidean Steiner tree problem (Q1265187):
Displaying 14 items.
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) (Q1941216) (← links)
- Concatenation-based greedy heuristics for the Euclidean Steiner tree problem (Q1961044) (← links)
- Efficient heuristics for orientation metric and Euclidean Steiner tree problems (Q1977863) (← links)
- Computing Euclidean Steiner trees over segments (Q2219516) (← links)
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) (Q2434638) (← links)
- Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
- New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\) (Q2776573) (← links)
- A delaunay triangulation‐based heuristic for the euclidean steiner problem (Q4303626) (← links)
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557) (← links)
