3 ms·
The problems I'm interested in have over 12k constraints and need to solve pretty fast. They're among the hardest MIP problems out there and I'd love to see how
by 4thaccount 8y ago
The problems I'm interested in have over 12k constraints and need to solve pretty fast. They're among the hardest MIP problems out there and I'd love to see how well a GA compares on a real model, but it will take me a long time to create a comparable GA model.
- sevensor 8y ago12k constraints? Without a major change in formulation, you're almost certainly way better off with convex optimization. As long as the problem is convex, anyway.