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