论文信息 - A reoptimization algorithm for the shortest path problem with time windows - 字舞流文

A reoptimization algorithm for the shortest path problem with time windows

M. Desrochers | F. Soumis

[1] V. V. Rodionov. The parametric problem of shortest distances , 1968 .

[2] A. Pan,et al. On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[3] Alberto L. Sangiovanni-Vincentelli,et al. A new shortest path updating algorithm , 1978, Networks.

[4] René Dionne. Etude Et Extension D’Un Algorithme De Murghland , 1978 .

[5] E. Denardo,et al. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[6] Giorgio Gallo,et al. Reoptimization procedures in shortest path problem , 1980 .

[7] Satoru Fujishige. A note on the problem of updating shortest paths , 1981, Networks.

[8] J. Desrosiers,et al. Plus court chemin avec contraintes d'horaires , 1983 .

[9] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[10] Jacques Desrosiers,et al. Routing with time windows by column generation , 1983, Networks.