1. Akartunal, K., Miller, A.J.: A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems (2007), Optimization Online,
http://www.optimization-online.org/DB_FILE/2007/05/1668.pdf
2. Aardal, K.: Capacitated Facility Location: Separation Algorithms and Computational Experience. Mathematical Programming A 81, 149–175 (1998)
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Inc., Englewood Cliffs (1993)
4. Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.A.: Network formulations of mixed-integer programs. Mathematics of Operations Research 34, 194–209 (2009)
5. Carr, R., Fleischer, L., Leung, V., Phillips, C.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 106–115 (2000)