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 |
-
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs
Takano, Yuichi, (2015)
-
Optimal berth allocation and time-invariant quay crane assignment in container terminals
Türkoğulları, Yavuz B., (2014)
-
Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
AKBALIK, Ayse, (2007)
- More ...
-
Computational experience with general cutting planes for the Set Covering problem
Avella, Pasquale, (2009)
-
Computational experience with general cutting planes for the Set Covering problem
Avella, Pasquale, (2009)
-
An aggregation heuristic for large scale p-median problem
Avella, Pasquale, (2012)
- More ...