Author:
Bartolini Enrico,Cordeau Jean-François,Laporte Gilbert
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference42 articles.
1. Amberg A., Voß S.: A hierarchical relaxations lower bound for the capacitated arc routing problem. In: Sprague, H.R. (eds) Proceedings of the 35th Hawaii International Conference on System Sciences, vol. 3., pp. 1–10. IEEE Computer Society, Washington DC (2002)
2. Assad, A.A., Golden, B.L.: Arc routing methods and applications. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, North-Holland, Amsterdam (1995)
3. Assad A.A., Pearn W.L., Golden B.L.: The capacitated postman problem: lower bounds and solvable cases. Am. J. Math. Manage. Sci. 7, 63–88 (1987)
4. Baldacci R., Christofides N., Mingozzi A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. A 115, 351–385 (2008)
5. Baldacci R., Maniezzo V.: Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47, 52–60 (2006)
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献