Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem.
Asghar AiniAmir SalehipourPublished in: Appl. Math. Lett. (2012)
Keyphrases
- shortest path problem
- dynamic programming
- learning algorithm
- computational cost
- shortest path
- cost function
- matching algorithm
- objective function
- high accuracy
- k means
- detection algorithm
- significant improvement
- preprocessing
- computational complexity
- bicriteria
- segmentation algorithm
- worst case
- benchmark problems
- single source
- experimental evaluation
- optimal solution
- expectation maximization
- optimization algorithm
- particle swarm optimization
- simulated annealing
- special case
- search space
- similarity measure