A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem
Year of publication: |
2010
|
---|---|
Authors: | Contreras, Ivan ; Fernández, Elena ; Marín, Alfredo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 202.2010, 2 (16.4.), p. 339-347
|
Saved in:
Saved in favorites
Similar items by person
-
Tight bounds from a path based formulation for the tree of hub location problem
Contreras, Ivan, (2009)
-
Lagrangean bounds for the optimum communication spanning tree problem
Contreras, Ivan, (2010)
-
Lagrangean bounds for the optimum communication spanning tree problem
Contreras, Ivan, (2010)
- More ...