Shortest paths in multi-modal dynamic networks

Development of efficient shortest path algorithms for real life path planning problems involving different means of transportation, time, multiple objectives, big data

Candidate: Andrea Nencini

Requirements: advanced coding skills, preferably C++