A matheuristic for the minimum weight rooted arborescence problem

Journal of Heuristics

Volumn 21, Issue 4, 2015, Pages 479-499

  Blum, Christian ^a,b   Calvo, Borja ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b BASQUE FOUNDATION FOR SCIENCE   (Spain)

Author keywords

Combinatorial optimization; Matheuristics; Minimum weight rooted arborescence problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER VISION; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PRODUCTION CONTROL;

ACYCLIC DIRECTED GRAPH; COMBINATORIAL OPTIMIZATION PROBLEMS; EXPERIMENTAL EVALUATION; MATHEURISTICS; MEMORY REQUIREMENTS; MINIMUM WEIGHT; MULTI-STAGE PRODUCTIONS; NEAR-OPTIMAL SOLUTIONS;

DIRECTED GRAPHS;

EID: 84937969749     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-015-9286-1     Document Type: Article

References (17)

1. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Finding tours in the TSP. Techical Report, Forschungsinstitut für Diskrete Mathematik, University of Bonn, Germany (1999)
2. Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135–4151 (2011)
3. Boschetti, M.A., Maniezzo, V., Roffilli, M., Bolufé Röhler, A.: Matheuristics: Optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) Proceedings of the HM 2009 Sixth International Workshop on Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 5818, pp. 171–177. Springer, Berlin (2009)
4. Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(3), 233–248 (2003)
5. Coudert, D., Nepomuceno, N., Rivano, H.: Power-efficient radio configuration in fixed broadband wireless networks. Comput. Commun. 33(8), 898–906 (2010)
6. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge, MA (2004)
7. Duhamel, C., Gouveia, L., Moura, P., Souza, M.: Models and heuristics for a minimum arborescence problem. Networks 51(1), 34–47 (2008)
8. Klau, G.W., Ljubić, I., Moser, A., Mutzel, P., Neuner, P., Pferschy, U., Raidl, G., Weiskircher, R.: Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. In: Proceedings of the GECCO 2004 -Genetic and Evolutionary Computation Conference. Lecture Notes in Computer Science, vol. 3102, pp. 1304–1315. Springer, Berlin (2004)
9. Mateo, S., Blum, C, Türetken, E., Fua, P.: Hybrid algorithms for the minimum-weight rooted arborescence problem. In: Dorigo M, Birattari M, Blum C, Christensen AL, Engelbrecht AP, Groß R, Stützle T (eds) Proceedings of ANTS 2012–8th International Conference on Swarm Intelligence. Lecture Notes in Computer Science, vol. 7461, pp. 61–72. Springer, Berlin (2012)
10. Nepomuceno, N., Pinheiro, P., Coelho, A.L.V.: A Hybrid Optimization Framework for Cutting and Packing Problems. Recent Advances in Evolutionary Computation for Combinatorial Optimization, Studies in Computational Intelligence, vol. 153, pp. 87–99. Springer, Berlin (2008)
11. Pinheiro, P.R., Coelho, A.L.V., de Aguiar, A.B., Bonates, T.O.: On the concept of density control and its application to a hybrid optimization framework: investigation into cutting problems. Comput. Industr. Eng. 61(3), 463–472 (2011)
12. Raidl, G.R.: Decomposition based hybrid metaheuristics. Eur. J. Oper. Res. (2014). In press
13. Talbi, E.G. (ed.): Hybrid Metaheuristics. Studies in Computational Intelligence. Springer, Berlin (2013)
14. 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)
15. Tutte, W.T.: Graph Theory. Cambridge University Press, Cambridge (2001)
16. Venkata Rao, V., Sridharan, R.: The minimum weight rooted arborescence problem: weights on arcs case. Technical Report, Indian Institute of Management Ahmedabad, Research and Publication Department (1992)
17. Venkata Rao, V., Sridharan, R.: Minimum-weight rooted not-necessarily-spanning arborescence problem. Networks 39(2), 77–87 (2002)