Another pedagogy for mixed-integer Gomory
We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a “dual form” mixed-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm. This follows the general scheme of He and Lee, who d...
Guardado en:
Autores principales: | Jon Lee, Angelika Wiegele |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/3030c8f5d9d94635b4d8ef0752cfb254 |
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) -
Restrict-and-relax search for 0-1 mixed-integer programs
por: Menal Guzelsoy, et al.
Publicado: (2013) -
Portfolio optimization with pw-robustness
por: Virginie Gabrel, et al.
Publicado: (2018) -
A constraint programming primer
por: Gilles Pesant
Publicado: (2014) -
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
por: W.e.i. Jiang, et al.
Publicado: (2020)