An ant colony system approach for solving the at-least version of the generalized minimum spanning tree problem

Proceedings - 2005 IEEE Swarm Intelligence Symposium, SIS 2005

Volumn 2005, Issue , 2005, Pages 60-67

  Das, Arindam K ^a   Arabshahi, Payman ^b   Gray, Andrew ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; PROBLEM SOLVING; TREES (MATHEMATICS);

ANT COLONY SYSTEM; GENERALIZED MINIMUM SPANNING TREE PROBLEM (L-GMST);

GLOBAL OPTIMIZATION;

EID: 33745783324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIS.2005.1501603     Document Type: Conference Paper

References (16)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, "Network flows: theory, algorithms, and applications, Prentice-Hall, 1993.
2. Y.S. Myung, C.H. Lee, and D.W. Tcha, "On the generalized minimum spanning tree problem," Networks, vol. 26, pp. 231-241, 1995.
3. E. Ihler, G. Reich, P. Widmayer, "Class Steiner trees and VLSI-design," Discrete Applied Mathematics, vol. 90, pp. 173-194, 1999.
4. U. Faigle, W. Kern, P. Pop and G. Still, "The Generalized minimum spanning tree problem," Working Paper, Dept. of Operations Research & Mathematical Programming, University of Twente, 2000.
5. M. Dror, M. Haouari and J. Chaouachi, "Generalized Steiner problems and other variants," J. Combinatorial Optimization, vol. 4, pp. 415-436, 2000.
6. M. Dror and M. Haouari, "Generalized spanning trees," European J. Operational Research, vol. 120, pp. 583-592, 2000.
7. P. Pop, W. Kern, and G. Still, "An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size," Working Paper, Dept. of Operations Research and Mathematical Programming, University of Twente, 2001.
8. C. Feremans, M. Labbé, and G. Laporte, "On generalized minimum spanning trees," European J. Operational Research, vol. 134, 2001, 457-458.
9. C. Feremans, Generalized spanning trees & extensions, Ph.D thesis, Universite Libré de Bruxelles, 2001.
10. P.C. Pop, The generalized minimum spanning tree problem, Ph.D thesis, University of Twente, 2002.
11. C. Feremans, M. Labbé, and G. Laporte, "A comparative analysis of several formulations for the generalized minimum spanning tree problem", Networks, vol. 39, pp. 29-34, 2002.
12. C. Feremans, M. Labbé, and G. Laporte, "Generalized network design problems," March 2002. http://citeseer.ist.psu.edu/ feremans02generalized.html
13. M. Dorigo and L.M. Gambardella, "Ant colonies for the traveling salesman problem," BioSystems, vol. 43, pp. 73-81, 1997.
14. E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm intelligence: from natural to artificial systems, Oxford University Press, 1999.
15. C.H. Papadimitriou and K. Steiglitz, "Combinatorial optimization: algorithms and complexity", Dover Publications, 1998.
16. J. Gross and J. Yellen, Graph theory and its applications," CRC Press, 1999.