An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two.
Sundar VishwanathanPublished in: Inf. Process. Lett. (1992)
Keyphrases
- matching algorithm
- experimental evaluation
- high accuracy
- detection algorithm
- learning algorithm
- error bounds
- computational complexity
- improved algorithm
- closed form
- cost function
- dynamic programming
- linear programming
- optimization algorithm
- worst case
- theoretical analysis
- convex hull
- similarity measure
- segmentation algorithm
- k means
- preprocessing
- objective function
- computational cost
- significant improvement
- clustering method
- ant colony optimization
- evolutionary algorithm
- times faster
- search space
- approximation algorithms
- approximation methods