90B99 None of the above, but in this section
Filtern
Erscheinungsjahr
- 2020 (1)
Dokumenttyp
- ZIB-Report (1)
Sprache
- Englisch (1)
Volltext vorhanden
- ja (1)
Gehört zur Bibliographie
- nein (1)
Schlagworte
- Time Dependent Shortest Paths (1) (entfernen)
Institut
We propose in this paper the Dynamic Multiobjective Shortest Problem. It features multidimensional states that can depend on several variables and not only on time; this setting is motivated by flight planning and electric vehicle routing applications. We give an exact algorithm for the FIFO case and derive from it an FPTAS, which is computationally efficient. It also features the best known complexity in the static case.