Aggregation and mixed integer rounding to solve MIPs
Year of publication: |
1998-06-01
|
---|---|
Authors: | MARCHAND, Hugues ; WOLSEY, Laurence A. |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | mixed integer programming | cutting planes | Gomory mixed integer cuts |
-
Mixing mixed-integer inequalities
GüNLüCK, Oktay, (1998)
-
On the practical strength of two-row tableau cuts
Dey, Santanu S., (2014)
-
Computational experiments with cross and crooked cross cuts
Dash, Sanjeeb, (2014)
- More ...
-
Cutting planes for integer programs with general integer variables
CERIA, Sebastian,
-
Dynamic knapsack sets and capacitated lot-sizing
LOPARIC, Marko,
-
The 0-1 Knapsack problem with a single continuous variable
MARCHAND, Hugues,
- More ...