Plus court chemin avec contraintes d'horaires
暂无分享,去创建一个
[1] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[2] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[5] H. Joksch. The shortest route problem with constraints , 1966 .
[6] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.