Constant-factor approximations for Capacitated Arc Routing without triangle inequality.
René van BevernSepp HartungAndré NichterleinManuel SorgePublished in: CoRR (2014)
Keyphrases
- triangle inequality
- constant factor
- routing problem
- quadratic assignment problem
- lower bound
- approximation algorithms
- similarity search
- np hard
- nearest neighbor
- distance function
- upper bound
- vehicle routing problem
- pre computed
- dissimilarity measure
- distance metric
- worst case
- metric space
- edit distance
- distance measure
- shortest path
- sample complexity
- similarity function
- nearest neighbor search
- lot sizing
- objective function
- similarity queries
- branch and bound
- branch and bound algorithm
- minimum cost
- lower and upper bounds
- tabu search
- edge weights
- constraint programming
- linear programming relaxation
- similarity measure
- high dimensional data
- knn