4 ms·
Obviously finding good tours with a limited computational budget is an interesting problem[1]. So, no, it's not misleading, as this method is more efficient at
by jeremysalwen 7y ago
Obviously finding good tours with a limited computational budget is an interesting problem[1]. So, no, it's not misleading, as this method is more efficient at finding good tours than brute-force (as claimed), and is even better than the NN heuristic.
[1] https://en.wikipedia.org/wiki/Travelling_salesman_problem#Heuristic_and_approximation_algorithms https://en.wikipedia.org/wiki/Travelling_salesman_problem#He...
- toolslive 7y agoat least you should specify which brute force approach you're comparing it with.
- thaumasiotes 7y agoWhat do you imagine the different brute force approaches are? I would assume the brute force approach is to calculate the cost of every possible route and choose the one that had the lowest cost.
- 7thaccount 7y agoBranch-and-bound MIP isn't very computationally intensive. I run models with millions of variables and constraints on my laptop. The commercial solvers (fast and best) are very expensive though. So you're kind of right in a eay.