Constant-factor approximations for Capacitated Arc Routing without triangle inequality.
René van BevernSepp HartungAndré NichterleinManuel SorgePublished in: Oper. Res. Lett. (2014)
Keyphrases
- constant factor
- triangle inequality
- routing problem
- quadratic assignment problem
- lower bound
- approximation algorithms
- np hard
- similarity search
- nearest neighbor
- distance function
- worst case
- upper bound
- metric space
- vehicle routing problem
- distance measure
- edit distance
- distance metric
- nearest neighbor search
- dissimilarity measure
- pre computed
- similarity function
- lot sizing
- optimal solution
- shortest path
- sample complexity
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- linear programming relaxation
- traveling salesman problem
- data points
- special case
- machine learning
- similarity queries
- high dimensional data
- training set
- similarity measure