On the prize-collecting generalized minimum spanning tree problem
From MaRDI portal
Publication:2480209
DOI10.1007/s10479-006-0153-1zbMath1144.90503OpenAlexW2014324934MaRDI QIDQ2480209
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0153-1
combinatorial optimizationlinear relaxationminimum spanning treesgeneralized minimum spanning tree problem
Related Items
A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
Cites Work