 | Monter d'un niveau |
Desaulniers, G., & Villeneuve, D. (2000). Shortest Path Problem With Time Windows and Linear Waiting Costs. Transportation Science, 34(3), 312-319. Lien externe
Gill, S., Desaulniers, G., Hurteau, R., & Ahmadi, M. (mai 2000). Path planning for a polygonal car-like robot in a polygonal environment [Communication écrite]. 31st International Symposium on Robotics (ISR 2000), Montréal, Québec. Non disponible
