Referenced Items are not available for this document.
The degree-constrained minimum spanning tree problem is of high practical importance. Up to now there have been few effective algorithms to solve this problem because of its NP-hard complexity. In this paper we present an approach to solving this problem by using genetic algorithms (GAs), and provide numerical example to demonstrate the efficiency of the proposed approach
Published in:
Systems, Man, and Cybernetics, 1996., IEEE International Conference on
(Volume:4
)
Date of Conference: 14-17 Oct 1996
- Page(s):
- 2683 - 2688 vol.4
- Meeting Date :
- 14 Oct 1996-17 Oct 1996
- ISSN :
- 1062-922X
- Print ISBN:
- 0-7803-3280-6
- INSPEC Accession Number:
- 5496326
- Conference Location :
- Beijing
- Digital Object Identifier :
- 10.1109/ICSMC.1996.561363
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
