A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem.
Daniela KühnDeryk OsthusViresh PatelPublished in: CoRR (2014)
Keyphrases
- randomly generated
- times faster
- matching algorithm
- improved algorithm
- cost function
- dynamic programming
- experimental evaluation
- learning algorithm
- convex hull
- np hard
- computational cost
- high accuracy
- similarity measure
- detection algorithm
- linear programming
- k means
- preprocessing
- objective function
- worst case
- significant improvement
- input data
- segmentation algorithm
- optimization algorithm
- active learning
- combinatorial optimization
- computational complexity
- solution quality
- optimal solution