An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problem

Simple item page
dc.contributor.authorGamvros, Ioannisen_US
dc.contributor.authorRaghavan, S.en_US
dc.contributor.authorGolden, Bruceen_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:12:43Z
dc.date.available2007-05-23T10:12:43Z
dc.date.issued2002en_US
dc.description.abstractCapacitated network design is a crucial problem to telecommunications network planners. In this paper we consider the Multi-Level Capacitated Minimum Spanning Tree Problem (MLCMST), a generalization of the well-known Capacitated Minimum Spanning Tree Problem. We present a genetic algorithm, based on the notion of grouping, that is quite effective in solving large-scale problems to within 10% of optimality.en_US
dc.format.extent256490 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6305
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2002-18en_US
dc.relation.ispartofseriesCSHCN; TR 2002-10en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleAn Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problemen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2002-18.pdf
Size:
250.48 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports