Combining ant colony optimization with dynamic programming for solving the k-cardinality tree problem

Lecture Notes in Computer Science

Volumn 3512, Issue , 2005, Pages 25-33

  Blum, Christian ^a   Blesa, Maria ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

METAHEURISTICS; OPTIMIZATION ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 25144469316     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494669_4     Document Type: Conference Paper

References (18)

1. M. Blesa, P. Moscato, and F. Xhafa. A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem. In Proc. of the 4th Metah. Intern. Conf., volume 1, pages 85-90, 2001.
2. M. Blesa and F. Xhafa. A C++ implementation of tabu search for k-cardinality tree problem based on generic programming and component reuse. In Net.ObjectDays 2000 Tagungsband, pages 648-652, Erfurt, Germany, 2000.
3. C. Blum. Revisiting dynamic programming for finding optimal subtrees in trees. Tech. Rep. LSI-04-57, Universitat Politècnica Catalunya, Spain, 2004. Submitted.
4. C. Blum and M. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research, 32:1355-1377, 2005.
5. C. Blum and M. Ehrgott. Local search algorithms for the k-cardinality tree problem. Discr. Appl. Math., 128:511-540, 2003.
6. J. Brimberg, D. Urošević, and N. Mladenović. Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur. J. of Op. Res., 2005. In press.
7. T. N. Bui and G. Sundarraj. Ant system for the k-cardinality tree problem. In K. Deb et al., editor, Proc. of the Genetic and Ev. Comp. Conference-GECCO 2004, volume 3102 of LNCS, pages 36-47. Springer, 2004.
8. S. Y. Cheung and A. Kumar. Efficient quorumcast routing algorithms. In Proceedings of INFOCOM'94, Los Alamitos, USA, 1994. IEEE Society Press.
9. M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992.
10. M. Dorigo, V. Maniezzo, and A. Colorni. Ant System: Optimization by a colony of cooperating agents. IEEE TSMC - Part B, 26:29-41, 1996.
11. M. Ehrgott and J. Freitag. K_TREE / K_SUBGRAPH: A program package for minimal weighted k-cardinality-trees and -subgraphs. Eur. J. of. Op. Res., 1:214-225, 1996.
12. M. Ehrgott, J. Freitag, H. W. Hamacher, and F. Maffioli. Heuristics for the k-cardinality tree and subgraph problem. Asia-Pac. J. of Op. Res., 14:87-114, 1997.
13. M. Fischetti, H. W. Hamacher, K. Jørnsten, and F. Maffioli. Weighted k-cardinality trees: Complexity and polyhedral structure. Networks, 24:11-21, 1994.
14. J. Freitag. Minimal k-cardinality trees (in German). Master's thesis, Department of Mathematics, University of Kaiserslautern, Germany, 1993.
15. K. Jörnsten and A. Løkketangen. Tabu search for weighted k-cardinality trees. Asia-Pac. J. of Op. Res, 14:9-26, 1997.
16. F. Maffioli. Finding a best subtree of a tree. Tech. Rep. 91.041, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
17. R. Uehara. The number of connected components in graphs and its applications. IEICE Tech. Rep. COMP99-10, Komazawa University, Japan, 1999.
18. D. Urošević, J. Brimberg, and N. Mladenović. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comp. & Op. Res., 31:1205-1213, 2004.