Author:
Fleury Gérard,Lacomme Philippe,Prins Christian
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Amberg, A., Voß, S.: A hierarchical relaxations lower bound for the Capacitated Arc Routing Problem. In: Sprague, R.H. (ed.) 35th Annual Hawaii Int. Conf. on Systems Sciences, Piscataway, pp. 1–10. IEEE, Los Alamitos (2002)
2. Belenguer, J.M., Benavent, E.: A cutting plane algorithm for the Capacitated Arc Routing Problem. Computers and Operations Research 30(5), 705–728 (2003)
3. Beullens, P., Muyldermans, L., Cattrysse, D., Van Oudheusden, D.: A guided local search heuristic for the Capacitated Arc Routing Problem. European Journal of Operational Research 147(3), 629–643 (2003)
4. Lecture Notes in Computer Science;J. Branke,1998
5. Fleury, G., Lacomme, P., Prins, C., Ramdane-Chérif, W.: Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc (2004) (to appear)
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献