An Evolutionary Approach to the Discovery of Hybrid Branching Rules for Mixed Integer Solvers

An evolutionary algorithm is used to search for problem specific branching rules within the branch-and-bound framework. For this purpose an instance generator is used to create training data for an integer programming problem, in particular the multi-dimensional 0/1 knapsack problem. An extensive experimental study will illustrate that new and more effective rules can be found using evolutionary computation.