Ant system for the k-cardinality tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3102, Issue , 2004, Pages 36-47

  Bui, Thang N ^a   Sundarraj, Gnanasekaran ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANT COLONY OPTIMIZATION; DISTRIBUTED COMPUTER SYSTEMS; FORESTRY; OPTIMIZATION; TABU SEARCH; TREES (MATHEMATICS);

ANT COLONY OPTIMIZATION ALGORITHMS; CARDINALITIES; EDGE-WEIGHTED GRAPH; LOCAL OPTIMIZATIONS; MINIMUM WEIGHT TREES; OPTIMIZATION TECHNIQUES; PROBLEM INSTANCES; TABU SEARCH ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 33750279119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_4     Document Type: Article

References (14)

1. Blesa, M. J. and F. Xhafa, "A C++ Implementation of Tabu Search for k-Cardinality Tree Problem Based on Generic Programming and Component Reuse," Net.ObjectDsays 2000 Tagungsband, NetObjectDays Forum, Germany, 2000, pp. 648-652.
2. Blum, C., "Ant Colony Optimization for the Edge-Weighted k-Cardinality Tree Problem," Proceedings of the Genetic and Evolutionary Computation Conference, 2002, pp. 27-34.
3. Blum, C. and M. Ehrgott, "Local Search Algorithms for the k-cardinality Tree Problem," Technical report TR/IRIDIA/2001-12, IRIDIA, Université Libre de Bruxelles, Belgium.
4. Borndörfer, R., C. Ferreira and A. Martin, "Decomposing Matrices Into Blocks," SIAM Journal on Optimization, 9(1), 1998, pp. 236-269.
5. Cheung, S. Y. and A. Kumar, "Efficient Quorumcast Routing Algorithms," in Proceedings of INFOCOM'94, Los Alamitos, 1994.
6. Cormen, T. H., C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Second Edition, McGraw-Hill, 2001.
7. Ehrgott, M., J. Freitag, H. W. Hamacher and F. Maffioli, "Heuristics for the k-cardinality Tree and Subgraph Problem," Asia Pacific Journal of Operational Research, 14(1), 1997, pp. 87-114.
8. Fischetti, M., W. Hamacher, K. Jornsten and F. Maffioli, "Weighted k-Cardinality Trees: Complexity and Polyhedral Structure," Networks, 24, 1994, pp. 11-21.
9. Foulds, L. R. and H. W. Hamacher, "A New Integer Programming Approach to (Restricted) Facilities Layout Problems Allowing Flexible Facility Shapes," Technical Report 1992-3, University of Waikato, Department of Management Science, 1992.
10. Foulds, L. H. Hamacher and J. Wilson, "Integer Programming Approaches to Facilities Layout Models with Forbidden Areas," Annals of Operations Research, 81, 1998, pp. 405-417.
11. Garg, N. and D. Hochbaum, "An O (log k) Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane," Algorithmica, 18, 1997, pp. 111-121.
12. Hamacher, H. W., K. Jornsten and F. Maffioli, "Weighted K-Cardinality Trees," Technical Report 91.023, Dept. di Elettronica, Politecnico di Milano, 1991.
13. Mladenovic, N., "Variable Neighborhood Search for the k-Cardinality Tree Problem," Proc. of the Metaheuristics International Conference, MIC'2001, 2001.
14. Ravi, R., R. Sundaram, M. V. Marathe, D. J. Rosenkrantz and S. S. Ravi, "Spanning Trees - Short or Small," SIAM J. on Discrete Mathematics, 9(2), 1996, pp. 178-200.