An exploratory computational analysis of dual degeneracy in mixed-integer programming
Dual degeneracy, i.e., the presence of multiple optimal bases to a linear programming (LP) problem, heavily affects the solution process of mixed integer programming (MIP) solvers. Different optimal bases lead to different cuts being generated, different branching decisions being taken and different...
Guardado en:
Autores principales: | Gerald Gamrath, Timo Berthold, Domenico Salvagnin |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2020
|
Materias: | |
Acceso en línea: | https://doaj.org/article/02acf5f02ecf4593a8b6c0599764c3ca |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Ten years of feasibility pump, and counting
por: Timo Berthold, et al.
Publicado: (2019) -
Improving strong branching by domain propagation
por: Gerald Gamrath
Publicado: (2014) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
por: Patrick Gemander, et al.
Publicado: (2020) -
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
por: FalkM. Hante, et al.
Publicado: (2019)