Author:
Chen Yiwei,Cornick Namrata,Hall Andrew O.,Shajpal Ritvik,Silberholz John,Yahav Inbal,Golden Bruce L.
Reference12 articles.
1. Bruggemann, Tobia, Monnot, Jerome, and Woeginger, Gerhard J. (2003). Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters, 31(3):195–201.
2. Cerulli, Raffaele, Fink, Andreas, Gentili,Monica, and Voss, Stefan (2005). Metaheuristics comparison for the minimum labelling spanning tree problem. In Golden, B, Raghavan, S, and Wasil, E, editors, The Next Wave in Computing, Optimization, and Decision Technologies, pages 93–106.
3. Chang, RS and Leu, Shing-Jiuan (1997). The minimum labeling spanning trees. Information Processing Letters, 63(5):277–282.
4. Michalewicz, Z (1996). Genetic Algorithms+ Data Structures= Evolution Programs. Springer.
5. Nummela, Jeremiah and Julstrom, Bryant A. (2006). An effective genetic algorithm for the minimum-label spanning tree problem. In GECCO ’06: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pages 553–558, New York, NY, USA. ACM Press.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献