A one-parameter genetic algorithm for the minimum labeling spanning tree problem

IEEE Transactions on Evolutionary Computation

Volumn 9, Issue 1, 2005, Pages 55-60

  Xiong, Yupei ^a   Golden, Bruce ^b   Wasil, Edward ^c  

^a Bldg 142   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c AMERICAN UNIVERSITY   (United States)

Author keywords

Genetic algorithm (GA); NP hard; Spanning trees

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

MAXIMUM VERTEX COVERING ALGORITHM; MINIMUM LABELING SPANNING TREE PROBLEM; SPANNING TREES;

GENETIC ALGORITHMS;

EID: 14844328038     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2004.840145     Document Type: Article

References (8)

1. T. Brüggemann, J. Monnot, and G. J. Woeginger, "Local search for the minimum label spanning tree problem with bounded color classes," Oper. Res. Lett., vol. 31, pp. 195-201, 2003.
2. R.-S. Chang and S.-J. Leu, "The minimum labeling spanning trees," Inf Process. Lett., vol. 63, no. 5, pp. 277-282, 1997.
3. H. Chou, G. Premkumar, and C.-H. Chu, "Genetic algorithms for communications network design - an empirical study of the factors that influence performance," IEEE Trans. Evol. Comput., vol. 5, no. 3, pp. 236-249, 2001.
4. B. Golden, S. Raghavan, and D. Stanojević, "Heuristic search for the generalized minimum spanning tree problem," INFORMS J. Comput., 2004, to be published.
5. S. O. Krumke and H.-C. Wirth, "On the minimum label spanning tree problem," Inf. Process. Lett., vol. 66, no. 2, pp. 81-85, 1998.
6. C. C. Palmer and A. Kershenbaum, "An approach to a problem in network design using genetic algorithms," Networks, vol. 26, no. 3, pp. 151-163, 1995.
7. Y. Wan, G. Chen, and Y. Xu, "A note on the minimum label spanning tree," Inf. Process. Lett., vol. 84, pp. 99-101, 2002.
8. Y. Xiong, B. Golden, and E. Wasil, "Worst case behavior of the MVCA heuristic for the minimum labeling spanning tree problem," Oper. Res. Lett., vol. 33, no. 1, pp. 77-80, 2005.