An interactive approach to identify the best compromise solution for two objective shortest path problems
- 1 January 1990
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 17 (2), 187-198
- https://doi.org/10.1016/0305-0548(90)90042-6
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- The Minimum‐Covering/Shortest‐Path Problem*Decision Sciences, 1988
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation NetworksTransportation Science, 1987
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path ProblemsOperations Research, 1987
- Multiobjective design of transportation networks: Taxonomy and annotationEuropean Journal of Operational Research, 1986
- The shortest path problem with two objective functionsEuropean Journal of Operational Research, 1986
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- On a multicriteria shortest path problemEuropean Journal of Operational Research, 1984
- A bicriterion shortest path algorithmEuropean Journal of Operational Research, 1982
- Current and future research directions in network optimizationComputers & Operations Research, 1981
- Deterministic network optimization: A bibliographyNetworks, 1977