A cutting plane algorithm for the capacitated facility location problem
Year of publication: |
2009
|
---|---|
Authors: | Avella, Pasquale ; Boccia, Maurizio |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 43.2009, 1, p. 39-65
|
Publisher: |
Springer |
Subject: | Capacitated facility location problem | Mixed dicut inequalities | Facet-enumeration |
-
Lower bounds for the capacitated facility location problem based on column generation
Klose, Andreas, (2001)
-
Optimal distribution of medical backpacks and health surveillance assistants in Malawi
Kunkel, Amber, (2014)
-
Performance of an add-drop-interchange heuristic for the capacitated facility location problem
Sinha, Pritibhushan, (2009)
- More ...
-
Solving a fuel delivery problem by heuristic and exact approaches
Avella, Pasquale, (2004)
-
A penalty function heuristic for the resource constrained shortest path problem
Avella, Pasquale, (2002)
-
A computational study of exact knapsack separation for the generalized assignment problem
Avella, Pasquale, (2010)
- More ...