Deakin University
Browse

File(s) under permanent embargo

Further results on an abstract model for branching and its application to mixed integer programming

Version 2 2024-06-13, 07:17
Version 1 2020-09-03, 14:24
journal contribution
posted on 2024-06-13, 07:17 authored by D Anderson, P Le Bodic, K Morgan
© 2020, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society. A key ingredient in branch and bound (B&B) solvers for mixed-integer programming (MIP) is the selection of branching variables since poor or arbitrary selection can affect the size of the resulting search trees by orders of magnitude. A recent article by Le Bodic and Nemhauser (Math Program 166(1–2):369–405, 2017) investigated variable selection rules by developing a theoretical model of B&B trees from which they developed some new, effective scoring functions for MIP solvers. In their work, Le Bodic and Nemhauser left several open theoretical problems, solutions to which could guide the future design of variable selection rules. In this article, we first solve many of these open theoretical problems. We then implement an improved version of the model-based branching rules in SCIP 6.0, a state-of-the-art academic MIP solver, in which we observe an 11 % geometric average time and node reduction on instances of the MIPLIB 2017 Benchmark Set that require large B&B trees.

History

Journal

Mathematical Programming

Volume

190

Pagination

811-841

ISSN

0025-5610

eISSN

1436-4646

Language

English

Publication classification

C1 Refereed article in a scholarly journal

Issue

1-2

Publisher

SPRINGER HEIDELBERG