| Article ID: | iaor20021964 |
| Country: | Netherlands |
| Volume: | 134 |
| Issue: | 2 |
| Start Page Number: | 457 |
| End Page Number: | 458 |
| Publication Date: | Oct 2001 |
| Journal: | European Journal of Operational Research |
| Authors: | Laporte Gilbert, Labb Martine, Feremans Corinne |
| Keywords: | programming: integer, graphs |
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.