The shortest path problem with two objective functions
- 31 May 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 25 (2) , 281-291
- https://doi.org/10.1016/0377-2217(86)90092-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A bicriterion shortest path algorithmEuropean Journal of Operational Research, 1982
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- Note on Multiple Objective Dynamic ProgrammingJournal of the Operational Research Society, 1980
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- Multidimensional Line Search Using a Binary Preference RelationOperations Research, 1979
- Ordinal Dynamic ProgrammingManagement Science, 1975
- Preference Order Dynamic ProgrammingManagement Science, 1974
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. IJournal of Applied Probability, 1970
- Dynamic programming in multiplicative latticesJournal of Mathematical Analysis and Applications, 1965