An improved multiobjective shortest path algorithm PM de las Casas, A Sedeno-Noda, R Borndörfer Computers & Operations Research 135, 105424, 2021 | 24 | 2021 |
Cost projection methods for the shortest path problem with crossing costs M Blanco, R Borndörfer, ND Hoang, A Kaier, P Maristany de las Casas, ... | 17 | 2017 |
An fptas for dynamic multiobjective shortest path problems P Maristany de las Casas, R Borndörfer, L Kraus, A Sedeño-Noda Algorithms 14 (2), 43, 2021 | 7 | 2021 |
Targeted multiobjective Dijkstra algorithm P Maristany de las Casas, L Kraus, A Sedeño‐Noda, R Borndörfer Networks 82 (3), 277-298, 2023 | 5* | 2023 |
A Priori Search Space Pruning in the Flight Planning Problem A Schienle, P Maristany, M Blanco 19th Symposium on Algorithmic Approaches for Transportation Modelling …, 2019 | 3 | 2019 |
Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data N Lindner, P Maristany de las Casas, P Schiewe | 2 | 2021 |
An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles M Blanco, R Borndörfer, P Maristany de las Casas 22nd Symposium on Algorithmic Approaches for Transportation Modelling …, 2022 | 1 | 2022 |
K-Shortest Simple Paths Using Biobjective Path Search PM Casas, A Sedeño-Noda, R Borndörfer, M Huneshagen arXiv preprint arXiv:2309.10377, 2023 | | 2023 |
Labeling Methods for Partially Ordered Paths R Euler, PM Casas arXiv preprint arXiv:2307.10332, 2023 | | 2023 |
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem P Maristany de las Casas, A Sedeño-Noda, R Borndörfer arXiv e-prints, arXiv: 2306.16203, 2023 | | 2023 |
K-Shortest Simple Paths Using Biobjective Path Search P Maristany de las Casas, A Sedeño-Noda, R Borndörfer, M Huneshagen Arxiv Preprint, 2023 | | 2023 |
Mathematik in der Flugplanung K Al-Bawani, MB Sandoval, R Borndörfer, A Kaier, P Maristany, ... Mitteilungen der Deutschen Mathematiker-Vereinigung 26 (4), 163-165, 2018 | | 2018 |
The Flight Trajectory Optimization Problem R Borndörfer, P Maristany Welcome letter iii, 27, 0 | | |