Login / Signup
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems.
Edward Yuhang He
Natashia Boland
George L. Nemhauser
Martin W. P. Savelsbergh
Published in:
INFORMS J. Comput. (2022)
Keyphrases
</>
shortest path problem
learning algorithm
computational efficiency
computational cost
orders of magnitude
computationally efficient
data structure
computational complexity
data sets
preprocessing
dynamic environments
theoretical analysis
benchmark datasets
combinatorial optimization