Loading...
Please wait, while we are loading the content...
Similar Documents
An FPTAS for Dynamic Multiobjective Shortest Path Problems
| Content Provider | MDPI |
|---|---|
| Author | Ralf, Borndörfer Antonio, Sedeño-Noda de Las Casas, Pedro Maristany Kraus, Luitgard |
| Copyright Year | 2021 |
| Description | 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 an FPTAS for both, the static Multiobjective Shortest Path (MOSP) problems and, under mild assumptions, for the dynamic problem variant. The resulting FPTAS is computationally efficient and beats the known complexity bounds of other FPTAS for MOSP problems. |
| Starting Page | 43 |
| e-ISSN | 19994893 |
| DOI | 10.3390/a14020043 |
| Journal | Algorithms |
| Issue Number | 2 |
| Volume Number | 14 |
| Language | English |
| Publisher | MDPI |
| Publisher Date | 2021-01-29 |
| Access Restriction | Open |
| Subject Keyword | Algorithms Transportation Multiobjective Shortest Paths Time Dependent Shortest Paths Multiobjective Approximation Algorithms Flight Planning Problem |
| Content Type | Text |
| Resource Type | Article |
