Cart (Loading....) | Create Account
Close category search window

A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhou, G. ; Dept. of Ind. & Syst. Eng., Ashikaga Inst. of Technol., Japan ; Gen, M. ; Tianzu Wu

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

Need Help?

IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.