Clustering as a precursor to efficient and near-optimal solution of small instances of the Traveling Salesperson Problem (TSP).
Vijay MarupudiVimal RaoJimin ParkRina HarschJeffrey ByeSashank VarmaPublished in: CogSci (2020)
Keyphrases
- optimal solution
- np hard
- search space
- learning algorithm
- linear programming
- medium size
- solution quality
- traveling salesman problem
- np complete
- small number
- data points
- lower bound
- clustering algorithm
- search algorithm
- computationally efficient
- self organizing maps
- cluster analysis
- objective function
- feasible solution
- fuzzy clustering
- integer programming
- global optimum
- categorical data
- linear programming relaxation
- greedy heuristic
- data sets