4 ms·
A branch and bound solver framework that accurately measures the impact that one component/heuristic has on time to proof of global optimality and any time beha
by freemint 5y ago
A branch and bound solver framework that accurately measures the impact that one component/heuristic has on time to proof of global optimality and any time behaviour under the optimal portfolio of those components and builds portfolio solvers
- max93 5y agoWhat do you mean by accurate? Deep learning may helps for non-convex space? But it may be no solution for global optimality.
- freemint 5y agoWell if i make the simplex iteration 20% faster what does do that performance and any terms performance of my mixed-integer linear programming solver one might implement in the framework. Due to parallelism and shared state the answer is non trivial. Let's say you want to people to cooperate in writing such a solver with payout proportional to speed up the solver got over a certain family of problems then accurate estimates how much contribution a new component has for the performance would be really helpful and would be an alternative having big companies bank roll closed source solver development. Deep learning is uterly irrelevant for the famework but it is a heuristic that could be employed ...