Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems

Finding a shortest path in a network is an iconic optimization problem. We focus on settings in which the travel time on an arc in the network depends on the time at which traversal of the arc begins. In such settings, reaching the sink as early as possible is not the only objective of interest. … Read more