A cutting plane algorithm for the capacitated facility location problem

@article{Avella2009ACP,
  title={A cutting plane algorithm for the capacitated facility location problem},
  author={Pasquale Avella and Maurizio Boccia},
  journal={Comp. Opt. and Appl.},
  year={2009},
  volume={43},
  pages={39-65}
}
The Capacitated Facility Location Problem (CFLP) is to locate a set of facilities with capacity constraints, to satisfy at the minimum cost the order-demands of a set of clients. A multi-source version of the problem is considered in which each client can be served by more than one facility. In this paper we present a reformulation of the CFLP based on Mixed Dicut Inequalities, a family of minimum knapsack inequalities of a mixed type, containing both binary and continuous (flow) variables. By… CONTINUE READING
13 Extracted Citations
19 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 13 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 19 references

An effective heuristic for large-scale capacitated plant location problems

  • P. Avella, M. Boccia, A. Sforza, I. Vasiliev
  • Technical Report, available online at http://www…
  • 2004
Highly Influential
4 Excerpts

On the solution of one and two-level capacitated facility location problems by the cutting plane approach

  • K. Aardal
  • Ph.D. thesis, Université Catholique de Louvain…
  • 1992
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…