.png){kind=icon}
.png){kind=icon}
Return
Faster MIP solutions via new node selection rules
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2009.11.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Mixed-integer programming
Node selection rules
Branch and bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W