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...
Saved in:
Main Authors: | Jon Lee, Angelika Wiegele |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2017
|
Subjects: | |
Online Access: | https://doaj.org/article/3030c8f5d9d94635b4d8ef0752cfb254 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An exploratory computational analysis of dual degeneracy in mixed-integer programming
by: Gerald Gamrath, et al.
Published: (2020) -
Restrict-and-relax search for 0-1 mixed-integer programs
by: Menal Guzelsoy, et al.
Published: (2013) -
Portfolio optimization with pw-robustness
by: Virginie Gabrel, et al.
Published: (2018) -
A constraint programming primer
by: Gilles Pesant
Published: (2014) -
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
by: W.e.i. Jiang, et al.
Published: (2020)