Revisiting dynamic programming for finding optimal subtrees in trees

European Journal of Operational Research

Volumn 177, Issue 1, 2007, Pages 102-115

  Blum, Christian ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Combinatorial optimization; Dynamic programming; Heuristics

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; METAHEURISTICS; OPTIMAL SUBTREES; SUBTREES;

TREES (MATHEMATICS);

EID: 33751061239     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.11.005     Document Type: Article

References (29)

1. Bertsekas D.P. Dynamic Programming and Optimal Control vol. 1 (1995), Athena Scientific, Belmont, MA
2. M.J. Blesa, P. Moscato, F. Xhafa, A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem, in: Proceedings of the Fourth Metaheuristics International Conference, vol. 1, 2001, pp. 85-90.
3. M.J. Blesa, 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, Erfurt, Germany, 2000, Net.ObjectDays-Forum, pp. 648-652.
4. Blum C., and Blesa M.J. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & Operations Research 32 6 (2005) 1355-1377
5. Blum C., and Ehrgott M. Local search algorithms for the k-cardinality tree problem. Discrete Applied Mathematics 128 (2003) 511-540 Selected for the Editors' choice volume of 2003
6. Blum C., and Roli A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35 3 (2003) 268-308
7. R. Borndörfer, C. Ferreira, A. Martin, Matrix decomposition by branch-and-cut, Technical report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1997.
8. Borndörfer R., Ferreira C., and Martin A. Decomposing matrices into blocks. SIAM Journal on Optimization 9 1 (1998) 236-269
9. J. Brimberg, D. Urošević, N. Mladenović, Variable neighborhood search for the vertex weighted k-cardinality tree problem, European Journal of Operational Research, in press.
10. Bui T.N., and Sundarraj G. Ant system for the k-cardinality tree problem. In: Deb K., et al. (Ed). Proceedings of the Genetic and Evolutionary Computation Conference-GECCO 2004. Lecture Notes in Computer Science vol. 3102 (2004), Springer-Verlag, Berlin, Germany 36-47
11. Cheung S.Y., and Kumar A. Efficient quorumcast routing algorithms. Proceedings of INFOCOM'94 (1994), IEEE Society Press, Los Alamitos, USA
12. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press and McGraw-Hill
13. Ehrgott M., and Freitag J. K_TREE/K_SUBGRAPH: A program package for minimal weighted k-cardinality-trees and -subgraphs. European Journal of Operational Research 1 93 (1996) 214-225
14. Ehrgott M., Freitag J., Hamacher H.W., and Maffioli F. Heuristics for the k-cardinality tree and subgraph problem. Asia-Pacific Journal of Operational Research 14 1 (1997) 87-114
15. Fischetti M., Hamacher H.W., Jørnsten K., and Maffioli F. Weighted k-cardinality trees: Complexity and polyhedral structure. Networks 24 (1994) 11-21
16. L.R. Foulds, 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.
17. Foulds L.R., Hamacher H.W., and Wilson J. Integer programming approaches to facilities layout models with forbidden areas. Annals of Operations Research 81 (1998) 405-417
18. J. Freitag, Minimal k-cardinality trees, Master's thesis, Department of Mathematics, University of Kaiserslautern, Germany, 1993 (in German).
19. Garg N., and Hochbaum D. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica 18 (1997) 111-121
20. H.W. Hamacher, K. Jørnsten, 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.
21. H.W. Hamacher, K. Jørnsten, F. Maffioli, Weighted k-cardinality trees, Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
22. Jørnsten K., and Løkketangen A. Tabu search for weighted k-cardinality trees. Asia-Pacific Journal of Operational Research 14 2 (1997) 9-26
23. Kruskal J.B. On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
24. F. Maffioli, Finding a best subtree of a tree, Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
25. Marathe M.V., Ravi R., Ravi S.S., Rosenkrantz D.J., and Sundaram R. Spanning trees short or small. SIAM Journal on Discrete Mathematics 9 2 (1996) 178-200
26. H.W. Philpott, N. Wormald, On the optimal extraction of ore from an open-cast mine, Technical report, University of Auckland, New Zeland, 1997.
27. Prim R.C. Shortest connection networks and some generalizations. Bell System Technical Journal 36 (1957) 1389-1401
28. R. Uehara, The number of connected components in graphs and its applications, IEICE Technical Report COMP99-10, Natural Science Faculty, Komazawa University, Japan, 1999.
29. Urošević D., Brimberg J., and Mladenović N. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & Operations Research 31 (2004) 1205-1213