Using multidimensional scaling to solve traveling salesman and machine scheduling problems.
Gregory P. WhiteDennis J. SweeneyPublished in: Comput. Oper. Res. (1980)
Keyphrases
- multidimensional scaling
- traveling salesman
- scheduling problem
- flowshop
- low dimensional
- cluster analysis
- traveling salesman problem
- high dimensional
- dimensionality reduction
- np hard
- kernel pca
- vector space
- tabu search
- quadratic assignment problem
- euclidean distance
- data mining
- high dimensional data
- special case
- machine learning