Computational experience with general cutting planes for the Set Covering problem
Year of publication: |
2009
|
---|---|
Authors: | Avella, Pasquale ; Boccia, Maurizio ; Vasilyev, Igor |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 37.2009, 1, p. 16-21
|
Saved in:
Saved in favorites
Similar items by person
-
A computational study of exact knapsack separation for the generalized assignment problem
Avella, Pasquale, (2010)
-
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 ...