A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.
Bang Ye WuPublished in: Algorithmica (2013)
Keyphrases
- shortest path problem
- single pass
- single source
- preprocessing
- benchmark problems
- similarity measure
- interval data
- times faster
- worst case
- probabilistic model
- learning algorithm
- computational complexity
- dynamic programming
- np hard
- cost function
- particle swarm optimization
- detection algorithm
- shortest path
- high efficiency
- k means
- convergence rate
- objective function
- bi objective
- search space
- recognition algorithm
- significant improvement
- computationally efficient
- simulated annealing
- experimental evaluation
- search strategy
- knapsack problem
- directed graph
- combinatorial optimization
- highly efficient
- multiple objectives
- segmentation algorithm
- expectation maximization
- bicriteria