An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
Published Online:1 Apr 2013https://doi.org/10.1287/opre.1120.1154
Supplemental Material
opre.1120.1154-sm.pdf (212 KB)
- Cited by
- 25 April 2026 | International Journal of Intelligent Transportation Systems Research, Vol. 98
- 5 December 2024 | Networks, Vol. 85, No. 3
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times22 May 2023 | Networks, Vol. 82, No. 4
- European Journal of Operational Research, Vol. 305, No. 1
- 28 February 2022 | Transportation Science, Vol. 56, No. 5
- Computers & Operations Research, Vol. 133
- Transportation Research Part E: Logistics and Transportation Review, Vol. 132
- Transportation Research Part E: Logistics and Transportation Review, Vol. 132
- 3 February 2018 | Annals of Operations Research, Vol. 273, No. 1-2
- Computers & Operations Research, Vol. 77
- Computer Networks, Vol. 86
- European Journal of Operational Research, Vol. 244, No. 1
- 11 April 2014 | Transportation Science, Vol. 49, No. 2
- European Journal of Operational Research, Vol. 238, No. 2
Volume 61, Issue 2
March-April 2013
Pages iii-529
Article Information
Supplemental Material
Metrics
Information
- Received:January 01, 2012
- Accepted:December 01, 2012
- Published Online:April 01, 2013
Copyright © 2013, INFORMS
Cite as
Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte, (2013) An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Operations Research 61(2):315-327.
https://doi.org/10.1287/opre.1120.1154
Keywords
