Author:
de Armas Jesica,Keenan Peter,Juan Angel A.,McGarraghy Seán
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference77 articles.
1. Aarts, E., Korst, J., & Michiels, W. (2005). Simulated annealing. In Search methodologies (pp. 187–210).
2. Ahr, D., & Reinelt, G. (2014). The capacitated arc routing problem: Combinatorial lower bounds. In Á. Corberán & G. Laporte (Eds.), Arc routing: Problems, methods, and applications (pp. 159–181). Philadelphia: Society for Industrial and Applied Mathematics.
3. Amberg, A., Domschke, W., & Voß, S. (2000). Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees. European Journal of Operational Research, 124, 360–376.
4. Aminua, U., & Eglese, R. (2006). A constraint programming approach to the chinese postman problem with time windows. Computers & Operations Research, 33, 3423–3431.
5. Baldacci, R., & Maniezzo, V. (2006). Exact methods based on node-routing formulations for undirected arc-routing problems. Networks, 47, 52–60.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献