2 ms·
No, it will take as much time and as many cpus as you have available, unless you manage to find the globally optimal solution earlier (practically never, for th
by whatever1 4y ago
No, it will take as much time and as many cpus as you have available, unless you manage to find the globally optimal solution earlier (practically never, for the problems that FedEx solves).
The number of variables is not a predictor of time and average complexity for integer programming.
We can solve some problems with millions of binaries in minutes. There are other problems with a couple of hundred of binaries that we cannot absolutely solve to optimality.
Sorry that this is your typical sorting problem.
- Sohcahtoa82 4y agoI'm wondering if we're talking about different things. If it takes 1 second of CPU time to process the path for 1 package, then it will take 1 million seconds of CPU time to path find 1 million packages. You can add more CPUs to run multiple path finds in parallel (ie, use 4 CPUs to cut the wall time to 250,000 seconds), but there's still 1 million core-seconds being spent.