Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem

DOI10.1007/978-3-319-53925-6_15zbMath1485.68301arXiv1604.08147OpenAlexW2964179139MaRDI QIDQ2980909

Fritz Bökler, Petra Mutzel

Publication date: 5 May 2017

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.08147

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Multi-objective and goal programming (90C29)

Cites Work

• Multiple criteria decision analysis. State of the art surveys. In 2 volumes
• On a multicriteria shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• A multicriteria Pareto-optimal path algorithm
• An empirical investigation of some bicriterion shortest path algorithms
• Parallel asynchronous label-correcting methods for shortest paths
• Shortest paths algorithms: Theory and experimental evaluation
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem