On the practical strength of two-row tableau cuts
Year of publication: |
2014
|
---|---|
Authors: | Dey, Santanu S. ; Lodi, Andrea ; Tramontani, Andrea ; Wolsey, Laurence A. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 2, p. 222-237
|
Subject: | mixed integer programming | cutting planes | lattice-free sets | computational investigation | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Notions of maximality for integral lattice-free polyhedra : the case of dimension three
Averkov, Gennadij, (2017)
-
Computational experiments with cross and crooked cross cuts
Dash, Sanjeeb, (2014)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
Two row mixed integer cuts via lifting
Dey, Santanu S., (2008)
-
Constrained infinite group relaxations of MIPs
Dey, Santanu S., (2009)
-
Lifting group inequalities and an application to mixing inequalities
Dey, Santanu S., (2009)
- More ...