Faster MIP solutions via new node selection rules

Authors:
Daniel T. Wojtaszek;John W. Chinneck
Affiliations:
Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada K1S 5B6;Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada K1S 5B6
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 2

MIP: Theory and Practice - Closing the Gap

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
A Computational Study of Search Strategies for Mixed Integer Programming

INFORMS Journal on Computing
Active-constraint variable ordering for faster feasibility of mixed integer linear programs

Mathematical Programming: Series A and B
MIPLIB 2003

Operations Research Letters
Branching rules revisited

Operations Research Letters

Achieving MILP feasibility quickly using general disjunctions

Computers and Operations Research
Backdoor Branching

INFORMS Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

When a branch and bound method is used to solve a linear mixed integer program (MIP), the order in which the nodes of the branch and bound tree are explored significantly affects how quickly the MIP is solved. In this paper, new methods are presented that exploit correlation and distribution characteristics of branch and bound trees to trigger backtracking and to choose the next node to solve when backtracking. A new method is also presented that determines when the cost of using a node selection method outweighs its benefit, in which case it is abandoned in favor of a simpler method. Empirical experiments show that these proposed methods outperform the current state of the art.