Improved branching disjunctions for branch-and-bound: An analytic center approach
A new approach to generate branching disjunctions based on the shape of the polyhedron. Uses the analytic center concept and Dikins ellipsoid from interior-point methods. Finds the minimum-width disjunction by solving a quadratic problem. Tested on multidimensional knapsack problems and MIPLIB instances. Shown to perform well. Tested within a branch-and-bound setting that is entirely based on interior-point concepts.
branch-and-bound analytic center generalized branching interior-point methods integer programming