Daniel Yamín

Orcid: 0000-0001-8770-2379

According to our database1, Daniel Yamín authored at least 5 papers between 2022 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
An Exact Method for Reliable Shortest Path Problems With Correlation.
Networks, 2026

2025
The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph.
INFORMS J. Comput., 2025

Transportation infrastructure maintenance planning: An exact column enumeration approach.
Comput. Oper. Res., 2025

2024
Reliable Routing Strategies on Urban Transportation Networks.
Transp. Sci., 2024

2022
Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks.
Comput. Oper. Res., 2022


  Loading...