A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

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

[2]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[3]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[6]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[7]  Ramchandran Jaikumar,et al.  A COMPUTERIZED VEHICLE ROUTING APPLICATION , 1982 .

[8]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[9]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[10]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[11]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[12]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[13]  Chryssi Malandraki,et al.  Time dependent vehicle routing problems : formulations, solution algorithms and computational experiments , 1989 .

[14]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[15]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[16]  M. Kostreva,et al.  Time Dependency in Multiple Objective Dynamic Programming , 1993 .