Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.
Karl BringmannChristian EngelsBodo MantheyB. V. Raghavendra RaoPublished in: Algorithmica (2015)
Keyphrases
- shortest path
- optimization problems
- geodesic distance
- randomly generated
- shortest path algorithm
- evolutionary algorithm
- euclidean distance
- euclidean space
- shortest path problem
- riemannian manifolds
- road network
- cost function
- optimal path
- weighted graph
- multi dimensional scaling
- flow graph
- metric space
- path length
- dynamic programming
- finding the shortest path
- objective function
- metaheuristic
- combinatorial optimization problems
- minimal surface
- knapsack problem
- distance measure
- travel time
- tangent space
- multi objective
- minimum length
- spatial networks
- traveling salesman problem
- minimum cost flow