A branch-and-cut algorithm for the angular TSP.
Isabel Méndez-DíazFederico PousaPaula ZabalaPublished in: CTW (2013)
Keyphrases
- np hard
- preprocessing
- search space
- learning algorithm
- k means
- dynamic programming
- matching algorithm
- times faster
- computationally efficient
- computational complexity
- recognition algorithm
- selection algorithm
- improved algorithm
- detection algorithm
- experimental evaluation
- memory requirements
- high accuracy
- theoretical analysis
- expectation maximization
- data sets
- optimization algorithm
- traveling salesman problem
- worst case
- significant improvement
- single pass
- hybrid algorithm
- tree structure
- simulated annealing
- computational cost
- cost function
- search algorithm
- objective function
- similarity measure
- neural network