A variable depth search branching

Fabien Cornillier; José Eduardo Pécora; Vincent Charles

A variable depth search branching

Fabien Cornillier, José Eduardo Pécora, Vincent Charles

Sección de Posgrado en Negocios

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

Resumen

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.

Idioma original	Español
Páginas (desde-hasta)	265-271
Número de páginas	7
Publicación	Operations Research Letters
Volumen	40
Estado	Publicada - 1 jul. 2012

Citar esto

@article{d196c3b3f44844c1968074325aefb061,

title = "A variable depth search branching",

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. {\textcopyright} 2012 Elsevier B.V. All rights reserved.",

author = "Fabien Cornillier and P{\'e}cora, {Jos{\'e} Eduardo} and Vincent Charles",

year = "2012",

month = jul,

day = "1",

language = "Espa{\~n}ol",

volume = "40",

pages = "265--271",

journal = "Operations Research Letters",

}

TY - JOUR

T1 - A variable depth search branching

AU - Cornillier, Fabien

AU - Pécora, José Eduardo

AU - Charles, Vincent

PY - 2012/7/1

Y1 - 2012/7/1

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. © 2012 Elsevier B.V. All rights reserved.

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. © 2012 Elsevier B.V. All rights reserved.

M3 - Artículo

VL - 40

SP - 265

EP - 271

JO - Operations Research Letters

JF - Operations Research Letters

ER -