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...
Enregistré dans:
Auteurs principaux: | Jon Lee, Angelika Wiegele |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2017
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/3030c8f5d9d94635b4d8ef0752cfb254 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
An exploratory computational analysis of dual degeneracy in mixed-integer programming
par: Gerald Gamrath, et autres
Publié: (2020) -
Restrict-and-relax search for 0-1 mixed-integer programs
par: Menal Guzelsoy, et autres
Publié: (2013) -
Portfolio optimization with pw-robustness
par: Virginie Gabrel, et autres
Publié: (2018) -
A constraint programming primer
par: Gilles Pesant
Publié: (2014) -
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
par: W.e.i. Jiang, et autres
Publié: (2020)