Hacker News (curated)new | past | comments | ask | show | jobs| show hidden

> seems like a boil the ocean kind of approach and I’m not sure if that’s ever going to be optimal

Finding the most optimal traveling salesman problem for 20 cities by brute force will take a few universes lifetimes and you still won’t be halls way. You’ll need to compromise with heuristics but that usually leads to near optimal



It depends on what you mean by brute force, you can easily do 20 cities with dynamic programming, which essentially is brute force with pruning.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact | github