TY - JOUR
T1 - A variable depth search branching
AU - Cornillier, Fabien
AU - Pécora, José Eduardo
AU - Charles, Vincent
N1 - Funding Information:
We express our gratitude to the referee for his valuable comments and suggestions that have significantly improved the quality of the paper. We also gratefully acknowledge the support of the Interuniversity Research Centre on Enterprise Networks , Logistics and Transportation (CIRRELT), Canada , and CENTRUM Católica, Peru , for their computing facilities.
PY - 2012/7
Y1 - 2012/7
N2 - 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.
AB - 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.
KW - Heuristic
KW - Local branching
KW - Mixed integer programming
KW - Variable depth search
UR - http://www.scopus.com/inward/record.url?scp=84861526078&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2012.03.003
DO - 10.1016/j.orl.2012.03.003
M3 - Article
AN - SCOPUS:84861526078
SN - 0167-6377
VL - 40
SP - 265
EP - 271
JO - Operations Research Letters
JF - Operations Research Letters
IS - 4
ER -