An improving dynamic programming algorithm to solve the shortest path problem with time windows.
Nora Touati MounglaLucas LétocartAnass NagihPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- dynamic programming
- shortest path problem
- single source
- detection algorithm
- preprocessing
- learning algorithm
- matching algorithm
- experimental evaluation
- computational complexity
- knapsack problem
- computational cost
- linear programming
- expectation maximization
- similarity measure
- shortest path
- optimization algorithm
- graphical models
- np hard
- cost function
- k means
- search space
- optimal solution
- particle swarm optimization
- data clustering
- sequence alignment
- lagrangian relaxation
- objective function
- bicriteria
- minimum length