A domination algorithm for {0, 1}-instances of the travelling salesman problem.
Daniela KühnDeryk OsthusViresh PatelPublished in: Random Struct. Algorithms (2016)
Keyphrases
- detection algorithm
- computational complexity
- times faster
- expectation maximization
- learning algorithm
- significant improvement
- cost function
- experimental evaluation
- randomly generated
- computationally efficient
- optimization algorithm
- dynamic programming
- computational cost
- high accuracy
- improved algorithm
- classification algorithm
- preprocessing
- quadratic assignment problem
- lower and upper bounds
- tree structure
- theoretical analysis
- search space
- np hard
- segmentation algorithm
- convex hull
- knapsack problem
- input data
- worst case
- k means