Improving strong branching by domain propagation
One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on. It precomputes the dual bounds of potential child nodes by...
Guardado en:
Autor principal: | Gerald Gamrath |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/041acfb2425f40c2b14433b148b10f1a |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
An exploratory computational analysis of dual degeneracy in mixed-integer programming
por: Gerald Gamrath, et al.
Publicado: (2020) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Ten years of feasibility pump, and counting
por: Timo Berthold, et al.
Publicado: (2019) -
Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016) -
The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020)