strategies: Blueprints for the next centry , International Journal of Physical Distribution and Logistics Management, 24(7), La Londe, Bernered,J., Masters, James,M.,34-37,1994
(2000), Efficient coordinated motion, Mathematical and Computer Modeling 31, Basu A, Elnagar A, Al-Hajj A, 39–53.
(1983), Combinatorial analysis for route first-cluster second vehicle routing, Omega 11(5), Mole RH, Johnson DG, Wells K, 507–512.
(1985), Optimal routing under capacity and distance restrictions. Operations Research 33(5), Laporte G, Nobert Y, Desrochers M, 1050–1073.
(2002), Branch-and-bound algorithms for the capacitated VRP, SIAM Monographs on Discrete Mathematics and Applications, Toth P, Vigo D, pp. 29–51.
(2002), Routing under uncertainty: an application in the scheduling of field service engineers, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, Hadjiconstantinou E, Roberts D, pp. 331–352.
(1997), The pickup and delivery problem”, Computers and Mathematics with Applications, Ruland KS, Rodin EY,pp. 33(12), 1–13.
(2004), Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows, Mitrovi´c-Mini´c S, Krishnamurti R, Laporte G, Transportation Research 28(8), 669–685.
(1954), Solution of a large-scale traveling salesman problem, Operations Research 2, Dantzig GB, Fulkerson DR, Johnson SM, 393–410.
(1960), Integer programming formulation of traveling salesman problems, Journal of Association for Computing Machinery 7, Miller CE, Tucker AW, Zemlin RA, 326–329.