Pages that link to "Item:Q1201819"
From MaRDI portal
The following pages link to Steiner's problem in graphs: Heuristic methods (Q1201819):
Displaying 21 items.
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- Generalized spanning trees (Q1579496) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- A heuristic for the Steiner problem in graphs (Q1918915) (← links)
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
- Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree (Q2252733) (← links)
- Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- (Q3974150) (← links)
- Worst-case relative performances of heuristics for the Steiner problem in graphs (Q3988522) (← links)
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut (Q4030930) (← links)
- A note on distributed multicast routing in point-to-point networks (Q5945321) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
