2 ms·
Are you talking about the packing problem or the traveling salesmen problem? Both are NP. Though so is k-means and we can still do a good job with stochastic se
by c3534l 9y ago
Are you talking about the packing problem or the traveling salesmen problem? Both are NP. Though so is k-means and we can still do a good job with stochastic search.