| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142467 | Operations Research Letters | 2012 | 7 Pages |
Abstract
We introduce a variable depth search branching, an extension to the local branching for solving Mixed-Integer Programs. Two strategies are assessed, a best improvement strategy and a first improvement strategy. The extensive computational assessment evidences a significant improvement over the local branching for both strategies.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fabien Cornillier, José Eduardo Jr., Vincent Charles,