# An FPTAS for Dynamic Multiobjective Shortest Path Problems
## 3 The Multiobjective Dijkstra Algorithm for Dynamic MOSP Problems
### Description of the Algorithm
In _Multiple Criteria Decision Making Theory and Application_; [PERSON], [PERSON], [PERSON]; Springer: Berlin/Heidelberg, Germany, 1980; pp. 109-127. * [PERSON] and [PERSON] (2006) [PERSON]; [PERSON] Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications. In _Algorithms and Computation_; [PERSON], [PERSON]; Springer: Berlin/Heidelberg, Germany, 2006; pp. 389-398. * [PERSON] et al. (2017) [PERSON]; [PERSON]; [PERSON] Analysis of FPTASes for the multi-objective shortest path problem. _Comput. Oper. Res._**2017**, _78_, 44-58. [CrossRef]
* [PERSON] and [PERSON] (2020) [PERSON]; [PERSON] Approximating Multiobjective Shortest Path in Practice. In _2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)_; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 2020; pp. 120-133. [CrossRef]
* [PERSON] and [PERSON] (2018) [PERSON]; [PERSON] [PERSON] A tutorial on multiobjective optimization: Fundamentals and evolutionary methods. _Nat. Comput._**2018**, _17_, 585-609,
* [PERSON] and [PERSON] (2006) [PERSON]; [PERSON] _Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys_; International Series in Operations Research & Management Science; Springer: New York, NY, USA, 2006. * [PERSON] and [PERSON] (2000) [PERSON]; [PERSON] [PERSON] A survey and annotated bibliography of multiobjective combinatorial optimization. _OR Spektrum_**2000**, _22_, 425-460. [CrossRef]
* [PERSON] and [PERSON] (1991) [PERSON]; [PERSON] Multi-objective shortest path problem: A survey. In _Proceedings of the International Workshop on Multicriteria Decision Making: Methods-Algorithms-Applications at Liblice, Czechoslovakia_; [PERSON], [PERSON], [PERSON], [PERSON]; Institute of Economics, Czechoslovak Academy of Sciences: Prague, Czech Republic, 1991; pp. 176-188. * [PERSON] and [PERSON] (1993) [PERSON]; [PERSON] Multiobjective transportation network design and routing problems: Taxonomy and annotation. _Eur. J. Oper. Res._**1993**, _65_, 4-19. [CrossRef]* _[PERSON] (2000)_ [PERSON] A classification of Bicriterion Shortest Path (BSP) algorithms. _Asia Pac. J. Oper. Res._**2000**, _17_, 199-212. * _[PERSON] (2007)_ [PERSON] Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms. _Int. J. Appl. Math. Comput. Sci._**2007**, _17_, 269-287. [CrossRef]
* _[PERSON] (2012)_ [PERSON]; [PERSON] Multicriteria path and tree problems: Discussion on exact algorithms and applications. _Int. Trans. Oper. Res._**2012**, _19_, 63-98. [CrossRef]
* _[PERSON] (1974)_ [PERSON] Problemes multicriteries. _Cal. Centre d' Etudes de Rech. Oper._**1974**, _16_, 425-439. * _[PERSON] (1986)_ [PERSON] Some considerations about computational complexity for multiobjective combinatorial problems. _Recent Adv. Hist. Dev. Vector Optim._**1986**, _294_, 222-232. * _[PERSON] (1984)_ [PERSON]. On a multicriteria shortest path problem. _Eur. J. Oper. Res._**1984**, _16_, 236-245. [CrossRef]
* _[PERSON] (2019)_ [PERSON]; [PERSON] A biobjective Dijkstra algorithm. _Eur. J. Oper. Res._**2019**, _276_, 106-118. [CrossRef]
* _[PERSON] (2020)_ [PERSON]; [PERSON]; [PERSON] _An Asymptotically and Computationally Improved Multiobjective Shortest Path Algorithm_; Technical Report 20-26. ZIB; Takustr: Berlin, Germany, 2020. * _[PERSON] (2000)_ [PERSON]; [PERSON] On the approximability of trade-offs and optimal access of Web sources. In Proceedings of the 41 st Annual Symposium on Foundations of Computer Science, Washington, DC, USA, 12-14 November 2000. [CrossRef]
* _[PERSON] (2002)_ [PERSON]; [PERSON] Multiple Objective Path Optimization for Time Dependent Objective Functions. In Multiple Objective and Goal Programming; [PERSON], [PERSON], Eds. ; Physica-Verlag HD: Heidelberg, Germany, 2002; pp. 127-142. * _[PERSON] (2008)_ [PERSON]; [PERSON]; [PERSON] Multi-criteria Shortest Paths in Time-Dependent Train Networks. _Exp. Algorithms Lect. Notes Comput. Sci._**2008**, _5038_, 347-361.