Title
A variable depth search branching
Date Issued
01 July 2012
Access level
open access
Resource Type
journal article
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. © 2012 Elsevier B.V. All rights reserved.
Start page
265
End page
271
Volume
40
Issue
4
Language
English
OCDE Knowledge area
Ingeniería de sistemas y comunicaciones
Matemáticas
Subjects
Scopus EID
2-s2.0-84861526078
Source
Operations Research Letters
ISSN of the container
01676377
Sponsor(s)
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.
Sources of information:
Directorio de Producción Científica
Scopus