Hybrid algorithms for the minimum-weight rooted arborescence problem

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

Volumn 7461 LNCS, Issue , 2012, Pages 61-72

  Mateo, Sergi ^a   Blum, Christian ^a   Fua, Pascal ^b   Türetgen, Engin ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION ALGORITHMS; EXPERIMENTAL EVALUATION; HYBRID ALGORITHMS; HYBRID TECHNIQUES; NOISY IMAGE; TREE STRUCTURES;

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; TREES (MATHEMATICS);

HEURISTIC ALGORITHMS;

EID: 84866365125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32650-9_6     Document Type: Conference Paper

References (10)

1. Blum, C.: Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research 177(1), 102-114 (2007)
2. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics - Part B 34(2), 1161-1172 (2004)
3. Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11(6), 4135-4151 (2011)
4. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
5. Duhamel, C., Gouveia, L., Moura, P., Souza, M.: Models and heuristics for a minimum arborescence problem. Networks 51(1), 34-47 (2008)
6. Stützle, T., Hoos, H.H.: MAX - MIN Ant System. Future Generation Computer Systems 16(8), 889-914 (2000)
7. Türetken, E., Benmansour, F., Fua, P.: Automated reconstruction of tree structures using path classifiers and mixed integer programming. In: Proceedings of CVPR 2012 - 25th IEEE Conference on Computer Vision and Pattern Recognition. IEEE Press (in press, 2012)
8. Türetken, E., González, G., Blum, C., Fua, P.: Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9(2-3), 279-302 (2011)
9. Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (2001)
10. Venkata Rao, V., Sridharan, R.: Minimum-weight rooted not-necessarily-spanning arborescence problem. Networks 39(2), 77-87 (2002)