2 ms·
It’s still probably not that simple; the problem seems like it can be analogous to some sort of knapsack and/or traveling salesman problem, which are NP-hard!
by bfung 4y ago
It’s still probably not that simple; the problem seems like it can be analogous to some sort of knapsack and/or traveling salesman problem, which are NP-hard! Even testing would take a long time.
- amluto 4y agoThat’s true if you want an optimal solution. If you just want a decent solution (for various definitions of decent), the complexity may not be too bad.