On generalized minimum spanning trees

Corinne Feremans

doi:10.1016/S0377-2217(00)00267-8

2001-10-01

PRE

Corinne Feremans

Martine Labbé *

Gilbert Laporte

DOI：10.1016/S0377-2217(00)00267-8

原文链接

原文求助

摘要

En 中文

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. (C) 2001 Elsevier Science B.V. All rights reserved.

Keyword:

generalized minimum spanning tree problem

integer linear programming