Branching rules revisited

Branching rules revisited

0.00 Avg rating0 Votes
Article ID: iaor2005739
Country: Netherlands
Volume: 33
Issue: 1
Start Page Number: 42
End Page Number: 54
Publication Date: Jan 2005
Journal: Operations Research Letters
Authors: , ,
Keywords: programming: branch and bound, programming: linear
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 computional studies we compare different parameter settings and show the superiority of our proposed new strategy.

Reviews

Required fields are marked *. Your email address will not be published.