Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10524025 | Operations Research Letters | 2005 | 13 Pages |
Abstract
We present a new generalization called reliability branching of today's state-of-the-art strong branching and pseudocost branching strategies for linear programming based branch-and-bound algorithms. After reviewing commonly used branching strategies and performing extensive computational studies we compare different parameter settings and show the superiority of our proposed new strategy.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tobias Achterberg, Thorsten Koch, Alexander Martin,