Free Access
| Issue |
RAIRO-Oper. Res.
Volume 25, Number 3, 1991
|
|
|---|---|---|
| Page(s) | 291 - 310 | |
| DOI | https://doi.org/10.1051/ro/1991250302911 | |
| Published online | 06 February 2017 | |
- 1. Y. P. ANEJA, V. AGGARWAL et K. P. K. NAIR, Shortest chain subject to side constraints, Networks, 1983, 13, p. 295-302. [MR: 706496] [Zbl: 0516.90028] [Google Scholar]
- 2. E. V. DENARDO, Dynamic Programming, Prentice-Hall, 1982. [Zbl: 0917.90282] [Google Scholar]
- 3. M. DESROCHERS, La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes, Thèse de doctorat, département d'informatique et de recherche opérationnelle, Université de Montréal, juin 1986, 169 p. [Google Scholar]
- 4. M. DESROCHERS et F. SOUMIS, A generalized permanent labelling algorithm for the shortest path problem with time Windows, INFOR, 1988, 26, p. 193-214. [Zbl: 0652.90097] [Google Scholar]
- 5. M. DESROCHERS et F. SOUMIS, A column generation approach to the urban transit crew scheduling problem. Transportation Sci., 1989, 23, p. 1-13. [Zbl: 0668.90043] [Google Scholar]
- 6. M. DESROCHERS, J. DESROSIERS et M. SOLOMON, A new optimization algorithm for the vehicle routing problem with time Windows, Rapport du GERAD G-90-30, 20 p. [Zbl: 0749.90025] [Google Scholar]
- 7. J. DESROSIERS, P. PELLETIER et F. SOUMIS , Plus court chemin avec contraintes d'horaires, R.A.I.R.O. Rech. Opér., 1983, 17, p. 357-377. [EuDML: 104840] [Zbl: 0528.90082] [Google Scholar]
- 8. J. DESROSIERS, F. SOUMIS et M. DESROCHERS, Routing with time Windows by column generation, Networks, 1984, 14, p. 545-565. [Zbl: 0571.90088] [Google Scholar]
- 9. W. HABENICHT, Efficient routes in vector-values graphs, Proceedings of the Seventh Conference on Graphtheoretic Concepts in Computer Science, J. R. MÜHLBACHER éd., Carl Hanser Verlag, Munich, 1981, p. 349-355. [MR: 708738] [Zbl: 0576.05041] [Google Scholar]
- 10. P. HANSEN, Bicriterion path problems, dans G. FANDEL et T. GAL éd., Multiple Criteria Decision Making: Theory and Applications, Lecture Notes in Economics and Mathematical Systems 177, Springer-Verlag, Heidelberg, 1980, p. 109-127. [MR: 572769] [Zbl: 0444.90098] [Google Scholar]
- 11. J. M. JAFFE, Algorithms for finding paths with multiple constraints, Networks, 1984, 14, p. 95-116. [MR: 730562] [Zbl: 0532.68068] [Google Scholar]
- 12. H. C. JOKSCH, The shortest route problem with constraints, J. Math. Analysis Applic., 1966, 14, p. 191-197. [MR: 192923] [Zbl: 0135.20506] [Google Scholar]
- 13. H. T. KUNG, F. LUCCIO et F. P. PREPARATA, On finding the maxima of a set of vectors, JACM, 1975, 22, 5, p. 469-476. [MR: 381379] [Zbl: 0316.68030] [Google Scholar]
- 14. E. Q. V. MARTINS, On a multicriteria shortest path problem, E. J. Oper. Res., 1984, 16, p. 236-245. [MR: 741403] [Zbl: 0533.90090] [Google Scholar]
- 15. M. MINOUX, Plus court chemin avec contraintes : algorithmes et applications, Ann. Télécommunic., 1975, 30, 12, p. 1-12. [Zbl: 0347.90065] [Google Scholar]
- 16. D. D. SLEATOR et R. E. TRAJAN, Self-ajusting binary trees, Proc. Fifteenth Annual ACM Symposium on the Theory of Computing, 1983, p. 235-245. [Google Scholar]
- 17. P. VINCKE, Problèmes multicritères, Cahiers Centre Études Rech. Opér., 1974, 16, 425-439. [MR: 368789] [Zbl: 0305.90045] [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.