Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm.
Youcef MagnoucheSébastien MartinPublished in: Optim. Lett. (2020)
Keyphrases
- worst case
- computational complexity
- computational cost
- space complexity
- significant improvement
- shortest path problem
- improved algorithm
- optimal solution
- matching algorithm
- detection algorithm
- theoretical analysis
- learning algorithm
- convex hull
- times faster
- clustering method
- shortest path
- high accuracy
- k means
- objective function
- optimization algorithm
- particle swarm optimization
- probabilistic model
- tree structure
- path planning
- preprocessing
- search algorithm
- recognition algorithm
- endpoints
- similarity measure
- neural network
- hamiltonian cycle