On generalized minimum spanning trees

被引：8

作者：

Feremans, C

Labbé, M

Laporte, G

机构：

[1] Free Univ Brussels, SMG, Serv Optimisat, Inst Stat & Rech Operat, B-1050 Brussels, Belgium

[2] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2001年 / 134卷 / 02期

关键词：

generalized minimum spanning tree problem; integer linear programming;

D O I：

10.1016/S0377-2217(00)00267-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：457 / 458

页数：2