A computational study of exact knapsack separation for the generalized assignment problem
| Year of publication: |
2010
|
|---|---|
| Authors: | Avella, Pasquale ; Boccia, Maurizio ; Vasilyev, Igor |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 45.2010, 3, p. 543-555
|
| Publisher: |
Springer |
| Subject: | Generalized assignment problem | Cutting plane algorithm | Exact separation |
-
Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
AKBALIK, Ayse, (2007)
-
Estimation of failure probability using semi-definite logit model
Konno, Hiroshi, (2003)
-
Xu, Lei, (2020)
- More ...
-
Time-indexed formulations for the runway scheduling problem
Avella, Pasquale, (2017)
-
Lifted and local reachability cuts for the vehicle routing problem with time windows
Avella, Pasquale, (2013)
-
Computational experience with general cutting planes for the Set Covering problem
Avella, Pasquale, (2009)
- More ...