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