Pages that link to "Item:Q933503"
From MaRDI portal
The following pages link to A tabu search heuristic for the generalized minimum spanning tree problem (Q933503):
Displayed 10 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- A rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← 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)