Pages that link to "Item:Q1276969"
From MaRDI portal
The following pages link to Class Steiner trees and VLSI-design (Q1276969):
Displaying 13 items.
- Generalized minimum spanning tree games (Q286691) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- Generalized network design problems. (Q1810478) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- MULTICASTING AND BROADCASTING IN UNDIRECTED WDM NETWORKS AND QoS EXTENTIONS OF MULTICASTING (Q5696973) (← links)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
