Pedro Maristany

Orcid: 0000-0002-4197-0893

Affiliations:
  • Zuse Institute Berlin, Berlin, Germany


According to our database1, Pedro Maristany authored at least 13 papers between 2017 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem.
Comput. Oper. Res., 2025

2024
Corrigendum to "Labeling methods for partially ordered paths" [European Journal of Operational Research 318 (2024) 19-30].
Eur. J. Oper. Res., 2024

Labeling methods for partially ordered paths.
Eur. J. Oper. Res., 2024

2023
Targeted multiobjective Dijkstra algorithm.
Networks, October, 2023

New Multiobjective Shortest Path Algorithms.
PhD thesis, 2023

K-Shortest Simple Paths Using Biobjective Path Search.
CoRR, 2023

2022
An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles.
Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

2021
Multiobjective Dijkstra A.
CoRR, 2021

An Improved Multiobjective Shortest Path Algorithm.
Comput. Oper. Res., 2021

An FPTAS for Dynamic Multiobjective Shortest Path Problems.
Algorithms, 2021

Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2019
A Priori Search Space Pruning in the Flight Planning Problem.
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2017
Cost Projection Methods for the Shortest Path Problem with Crossing Costs.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017


  Loading...