A comparison of solution strategies for biobjective shortest path problems
Top Cited Papers
- 1 April 2009
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 36 (4), 1299-1331
- https://doi.org/10.1016/j.cor.2008.02.002
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- On the cardinality of the Pareto set in bicriteria shortest path problemsAnnals of Operations Research, 2006
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satelliteEuropean Journal of Operational Research, 2002
- A label correcting approach for solving bicriterion shortest-path problemsComputers & Operations Research, 2000
- Shortest paths algorithms: Theory and experimental evaluationMathematical Programming, 1996
- A multicriteria Pareto-optimal path algorithmEuropean Journal of Operational Research, 1992
- An empirical investigation of some bicriterion shortest path algorithmsEuropean Journal of Operational Research, 1989
- Shortest path algorithmsAnnals of Operations Research, 1988
- Some Considerations about Computational Complexity for Multi Objective Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1987
- On a multicriteria shortest path problemEuropean Journal of Operational Research, 1984
- Bicriterion Path ProblemsPublished by Springer Science and Business Media LLC ,1980