A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem.
Edward HeNatashia BolandGeorge L. NemhauserMartin W. P. SavelsberghPublished in: CPAIOR (2018)
Keyphrases
- shortest path problem
- preprocessing
- detection algorithm
- dynamic programming
- shortest path
- computational cost
- learning algorithm
- single source
- search space
- computational complexity
- expectation maximization
- optimal solution
- cost function
- k means
- search strategy
- worst case
- data clustering
- combinatorial optimization
- bicriteria
- optimization algorithm
- dynamic environments
- particle swarm optimization
- upper bound
- probability distribution
- image segmentation