Abstract
The generalized minimum spanning tree problem consists of designing a minimum cost tree spanning several clusters. The purpose of this note is to pinpoint several inaccuracies contained in a previous publication and to propose a valid formulation for this problem.
| Original language | English |
|---|---|
| Pages (from-to) | 457-458 |
| Journal | European Journal of Operational Research |
| Volume | 134 |
| DOIs | |
| Publication status | Published - 1 Jan 2001 |