## Benders decomposition without separability: A computational study for capacitated facility location problems

- Matteo Fischetti, Ivana Ljubic, Markus Sinnl
- European Journal of Operational Research
- 2016

Highly Influenced

@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} }

- Published 2009 in Comp. Opt. and Appl.
DOI:10.1007/s10589-007-9125-x

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