Plus court chemin avec contraintes d'horaires
Open Access
- 1 January 1983
- journal article
- research article
- Published by EDP Sciences in Rairo-Operations Research
- Vol. 17 (4), 357-377
- https://doi.org/10.1051/ro/1983170403571
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- Plus court chemin avec contraintes : Algorithmes et applicationsAnnals of Telecommunications, 1975
- The shortest route problem with constraintsJournal of Mathematical Analysis and Applications, 1966
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958