1. Assad, A.A. and B.L. Golden (1995). “Arc routing methods and applications”, in M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (Eds.) Network Routing. Handbooks of Operations Research and Management Science 8. Amsterdam: North Holland, 375–483.
2. Balinski, M.L. and Quandt, R.E., (1964). “On an integer program for a delivery problem”, Operations Research 12, 300–304.
3. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., and Vance, P.H., (1998). “Branch-and-price: Column generation for solving huge integer programs”, Operations Research, 46, 316–329.
4. Beasley, J.E. and Chrostofides, N., (1989). “An algorithm for the resource constrained shortest path problem”, Networks 19, 379–394.
5. Benavent, E., A. Corberán, and J.M. Sanchis (2000). “Linear programming based methods for solving arc routing problems”, in Dror, M. ed., Arc Routing: Theory, Solutions, and Applications, Kluwer Academic Publishers (this book).