Approximating Multiobjective Shortest Path in Practice

DOI10.1137/1.9781611976007.10MaRDI QIDQ5147503zbMATH OpenOpenAlexFDO

Authors Fritz Bökler, Markus Chimani

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611976007.10

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(9)

• Multi-objective and multi-constrained non-additive shortest path problems
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• The Value of Side Information in Shortest Path Optimization
• Complexity of the multiobjective minimum weight minimum stretch spanner problem
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• Multi-criteria approximation schemes for the resource constrained shortest path problem
• A survey of exact and approximation algorithms for linear-parametric optimization problems

This page was built for publication: Approximating Multiobjective Shortest Path in Practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147503)