Free Access
| Issue |
RAIRO-Oper. Res.
Volume 17, Number 4, 1983
|
|
|---|---|---|
| Page(s) | 357 - 377 | |
| DOI | https://doi.org/10.1051/ro/1983170403571 | |
| Published online | 06 February 2017 | |
- 1. R. E. BELLMAN, On a Routing Problem, Quart. Appl. Math., 16, 1958, p. 87-90. [MR: 102435] [Zbl: 0081.14403] [Google Scholar]
- 2. J. DESROSIERS, F. SOUMIS et M. DESROCHERS, Routing with Time Windows by Column Generation, Rapport de recherche G83-15, École des Hautes Études Commerciales, Université de Montréal, 1983 (soumis pour publication à NETWORKS). [Zbl: 0571.90088] [Google Scholar]
- 3. E. W. DIJKSTRA, A Note on Two Problems in Connexion with Graph, Numer, Math., vol. 1, 1959, p. 269-271. [EuDML: 131436] [MR: 107609] [Zbl: 0092.16002] [Google Scholar]
- 4. L. R. Jr FORD : Network Flow Theory, The Rand Corporation, vol. 293, 1956. [Google Scholar]
- 5. G. Y. HANDLER et I. ZANG, A Dual Algorithm for the Constrained Shortest Path Problem, Networks, vol. 10, 1980, p. 293-310. [MR: 597270] [Zbl: 0453.68033] [Google Scholar]
- 6. H. C. JOKSCH, The Shortest Route Problem with Constraints, J. Math. Anal. Appl., vol. 14, 1966, p. 191-197. [MR: 192923] [Zbl: 0135.20506] [Google Scholar]
- 7. C. E. MILLER, A. W. TUCKER et R. A. ZEMLIN, Integer Programming Formulation of Travelling Salesman Problems, ACM, vol. 7, 1960, p. 326-329. [MR: 149964] [Zbl: 0100.15101] [Google Scholar]
- 8. M. MINOUX, Plus court chemin avec contraintes : algorithmes et applications, Annales des télécommunications, tome 30, 1975, p. 383-394. [Zbl: 0347.90065] [Google Scholar]
- 9. E. F. MOORE, The Shor test Path Trough a Maze (Proc. of international Symposium on the Theory of Switching, Part II, Apr. 2-5, 1957, Harvard University Press, Cambridge, Mass., 1959). [MR: 114710] [Google Scholar]
- 10. S. PALLOTTINO, Adaptation de l'algorithme de D'Esopo-Pape pour la détermination de tous les chemins les plus courts : améliorations et simplifications, publication n° 136, Centre de recherche sur les transports, Université de Montréal, 1979. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.