On the cardinality of the Pareto set in bicriteria shortest path problems

DOI10.1007/s10479-006-0072-1zbMath1188.90245WikidataQ57013298 ScholiaQ57013298MaRDI QIDQ2379876

Matthias Müller-Hannemann, Karsten Weihe

Publication date: 23 March 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0072-1

zbMATH Keywords

railway networks

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C29: Multi-objective and goal programming

Related Items

Multiobjective shortest path problems with lexicographic goal-based preferences, Bi-objective robust optimisation, Dimensionality reduction in multiobjective shortest path search, A comparison of heuristic best-first algorithms for bicriterion shortest path problems, Lower bound sets for biobjective shortest path problems, A comparison of solution strategies for biobjective shortest path problems, An exact method for the biobjective shortest path problem for large-scale road networks, How to find good night train connections, Trip-Based Public Transit Routing, Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications

Uses Software

• CNOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parametric approach to solving bicriterion shortest path problems
• A bicriterion shortest path algorithm
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• An empirical investigation of some bicriterion shortest path algorithms
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A label correcting approach for solving bicriterion shortest-path problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Finding the k Shortest Paths
• Dijkstra's algorithm on-line