A new hybrid evolutionary algorithm for the k-cardinality tree problem

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 515-522

  Blum, Christian ^a  

^a Campus Nord   (Spain)

Author keywords

Evolutionary computation; k cardinality tree problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DYNAMIC PROGRAMMING; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

EDGE WEIGHTS; GENETIC OPERATORS; K-CARDINALITIES; METAHEURISTICS;

GENETIC ALGORITHMS;

EID: 33750280156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. T. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
2. C. Blum. Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research, 2006. In press.
3. C. Blum and M. Blesa. Combining Ant Colony Optimization with Dynamic Programming for solving the k-cardinality tree problem. In 8th International Work-Conference on Artificial Neural Networks, Computational Intelligence and Bioinspired Systems (IWANN'05), volume 3512 of Lecture Notes in Computer Science, pages 25-33. Springer-Verlag, Berlin, 2005.
4. C. Blum and M.J. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research, 32(6):1355-1377, 2005.
5. C. Blum and M. Ehrgott. Local search algorithms for the k-cardinality tree problem. Discrete Applied Mathematics, 128:511-540, 2003. Selected for the Editors' choice volume of 2003.
6. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268-308, 2003.
7. R. Borndörfer, C. Ferreira, and A. Martin. Matrix decomposition by Branch-and-Cut. Technical report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1997.
8. R. Borndörfer, C. Ferreira, and A. Martin. Decomposing matrices into blocks. SIAM Journal on Optimization, 9(1):236-269, 1998.
9. J. Brimberg, D. Urošević, and N. Mladenović. Variable neighborhood search for the vertex weighted k-cardinality tree problem. European Journal of Operational Research, 2005. In press.
10. T. N. Bui and G. Sundarraj. Ant system for the k-cardinality tree problem. In K. Deb et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2004, volume 3102 of Lecture Notes in Computer Science, pages 36-47. Springer Verlag, Berlin, Germany, 2004.
11. S. Y. Cheung and A. Kumar. Efficient quorumcast routing algorithms. In Proceedings of INFOCOM'94, Los Alamitos, USA, 1994. IEEE Society Press.
12. M. Ehrgott and J. Freitag. K_TREE/K_SUBGRAPH: A program package for minimal weighted k-cardinality-trees and -subgraphs. European Journal of Operational Research, 1(93):214-225, 1996.
13. M. Ehrgott, 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):87-114, 1997.
14. M. Fischetti, H. W. Hamacher, K. Jørnsten. and F. Maffioli. Weighted k-cardinality trees: Complexity and polyhedral structure. Networks, 24:11-21, 1994.
15. L. R. Foulds and H. W. Hamacher. A new integer programming approach to (restricted) facilities layout problems allowing flexible facility shapes. Technical Report 1992-3, Department of Management Science, University of Waikato, New Zealand, 1992.
16. L. R. Foulds, H. W. Hamacher, and J. Wilson. Integer programming approaches to facilities layout models with forbidden areas. Annals of Operations Research, 81:405-417, 1998.
17. J. Freitag. Minimal k-cardinality trees. Master's thesis, Department of Mathematics, University of Kaiserslautern, Germany, 1993. In german.
18. N. Garg and D. Hochbaum. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica, 18:111-121, 1997.
19. H. W. Hamacher and K. Joernsten. Optimal relinquishment according to the Norwegian petrol law: A combinatorial optimization approach. Technical Report No.-7/93, Norwegian School of Economics and Business Administration, Bergen, Norway, 1993.
20. H. W. Hamacher, K. Jörnsten, and F. Maffioli. Weighted k-cardinality trees. Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
21. A. Hertz and D. Kobler. A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126:1-12, 2000.
22. F. Maffioli. Finding a best subtree of a tree. Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
23. M. V. Marathe, R. Ravi, S. S. Ravi, D. J. Rosenkrantz, and R. Sundaram. Spanning trees short or small. SIAM Journal on Discrete Mathematics, 9(2):178-200, 1996.
24. H. W. Philpott and N. Wormald. On the optimal extraction of ore from an open-cast mine. Technical report, University of Auckland, New Zeland, 1997.
25. J. Puchinger and G. R. Raidl. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In J. Mira and J. R. Álvarez, editors, Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, volume 3562 of Lecture Notes in Computer Science, pages 41-53. Springer Verlag, Berlin, Germany, 2005.
26. R. Uehara. The number of connected components in graphs and its applications. IEICE Technical Report COMP99-10, Natural Science Faculty, Komazawa University, Japan, 1999.
27. D. Urošević, J. Brimberg, and N. Mladenović. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & Operations Research, 31:1205-1213, 2004.