The Shortest Path Problem with Time Windows and Linear Waiting Costs
暂无分享,去创建一个
[1] Matteo Fischetti,et al. A branch and bound algorithm for the multiple depot vehicle scheduling problem , 1989, Networks.
[2] Guy Desaulniers,et al. Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..
[3] Jacques Desrosiers,et al. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .
[4] Hani S. Mahmassani,et al. Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .
[5] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[6] Pierre Hansen,et al. Optimum departure times for commuters in congested networks , 1991 .
[7] J. Desrosiers,et al. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .
[8] M. Desrochers,et al. A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .
[9] J. Desrosiers,et al. Plus court chemin avec contraintes d'horaires , 1983 .
[10] Lucio Bianco,et al. An Exact Algorithm for Combining Vehicle Trips , 1995 .
[11] Moshe Dror,et al. Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..
[12] Xiaoqiang Cai,et al. Time-varying shortest path problems with constraints , 1997 .