An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
暂无分享,去创建一个
Jacques Desrosiers | Marius M. Solomon | Yvan Dumas | Éric Gélinas | Y. Dumas | J. Desrosiers | Éric Gélinas | M. Solomon
[1] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[2] Edward K. Baker,et al. Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..
[3] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[4] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[5] Alexander H. G. Rinnooy Kan,et al. Vehicle Routing with Time Windows , 1987, Oper. Res..
[6] M. Desrochers,et al. A reoptimization algorithm for the shortest path problem with time windows , 1988 .
[7] Jacques Desrosiers,et al. The Pickup and Delivery Problem with Time Windows , 1989 .
[8] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[9] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[10] André Langevin,et al. A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows , 1990, Networks.