Label Correcting Methods to Solve Multicriteria Shortest Path Problems
- 1 December 2001
- journal article
- Published by Springer Science and Business Media LLC in Journal of Optimization Theory and Applications
- Vol. 111 (3), 589-613
- https://doi.org/10.1023/a:1012602011914
Abstract
In this paper, we deal with the solution of the multicriteria shortest path problem. In particular, we present a class of labeling methods to generate the entire set of Pareto-optimal path-length vectKeywords
This publication has 17 references indexed in Scilit:
- A label correcting approach for solving bicriterion shortest-path problemsComputers & Operations Research, 2000
- An interactive bi-objective shortest path approach: searching for unsupported nondominated solutionsComputers & Operations Research, 1999
- An interactive procedure using domination cones for bicriterion shortest path problemsEuropean Journal of Operational Research, 1994
- A multicriteria Pareto-optimal path algorithmEuropean Journal of Operational Research, 1992
- Generalized dynamic programming for multicriteria optimizationEuropean Journal of Operational Research, 1990
- An interactive approach to identify the best compromise solution for two objective shortest path problemsComputers & Operations Research, 1990
- An empirical investigation of some bicriterion shortest path algorithmsEuropean Journal of Operational Research, 1989
- Multiobjective design of transportation networks: Taxonomy and annotationEuropean Journal of Operational Research, 1986
- On a multicriteria shortest path problemEuropean Journal of Operational Research, 1984
- A bicriterion shortest path algorithmEuropean Journal of Operational Research, 1982