Predicting Hardness of Travelling Salesman Problem Instances.

Miguel Cárdenas-Montes

Published in: CAEPIA (2016)

Keyphrases

quadratic assignment problem
computational complexity
random instances
phase transition
neural network
np complete
worst case
learning theory
training instances
np complete problems
np hard
evolutionary algorithm
stochastic local search
feature selection
np hardness
real time
agnostic learning