An FPTAS for Dynamic Multiobjective Shortest Path Problems

An FPTAS for Dynamic Multiobjective Shortest Path Problems

The Dynamic Multiobjective Shortest Path problem features multidimensional costs that can depend on several variables and not only on time; this setting is motivated by flight planning applications and the routing of electric vehicles. We give an exact algorithm for the FIFO case and derive from it...

Full description

Bibliographic Details
Main Authors: Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus, Antonio Sedeño-Noda
Format: Article
Language:English
Published: MDPI AG 2021-01-01
Series:Algorithms
Subjects:
multiobjective shortest paths
time dependent shortest paths
multiobjective approximation algorithms
flight planning problem
Online Access:https://www.mdpi.com/1999-4893/14/2/43

Internet

https://www.mdpi.com/1999-4893/14/2/43

Similar Items