A study of a look-ahead procedure for solving the multiterminal delivery problem

[1]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[2]  J. F. Pierce.  Direct search algorithms for truck-dispatching problems , 1969 .

[3]  K. W. Knight,et al.  Vehicle Scheduling with Timed and Connected Calls: A Case Study , 1968 .

[4]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[5]  W. H. Hausman,et al.  A multi-period truck delivery problem☆ , 1967 .

[6]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[7]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[8]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[9]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[10]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[11]  Selmer M. Johnson,et al.  On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

[12]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[13]  L. L. Barachet.  Letter to the Editor---Graphic Solution of the Traveling-Salesman Problem , 1957 .

[14]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[15]  Robert William Hering,et al.  Evaluation of some heuristic look ahead rules for multiple terminal delivery problems , 1970 .

[16]  William Christian Elvin Braun,et al.  A computerized simulation approach to the solution of the carrier dispatching problem , 1967 .

[17]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .