Pages that link to "Item:Q3786299"
From MaRDI portal
The following pages link to Problem reduction methods and a tree generation algorithm for the steiner network problem (Q3786299):
Displaying 19 items.
- Models and algorithms for network reduction (Q320811) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- Using structured steiner trees for hierarchical global routing (Q3348418) (← links)
- Some generalizations of the steiner problem in graphs (Q3787806) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- Reductions for the rectilinear steiner tree problem (Q4894857) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
- An exact branch and bound algorithm for the Steiner Problem in Graphs (Q6085757) (← links)
