On the prize-collecting generalized minimum spanning tree problem
From MaRDI portal
Publication:2480209
DOI10.1007/s10479-006-0153-1zbMath1144.90503MaRDI 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 optimization; linear relaxation; minimum spanning trees; generalized minimum spanning tree problem
Related Items
Cites Work