1. Aardal, K.: Capacitated facility location: separation algorithms and computational experience. Math. Program. A 81, 149–175 (1998)
2. Akartunal, K., Miller, A.J.: A Computational analysis of lower bounds for big bucket production planning problems. Optimization. http://www.optimization-online.org/DB_FILE/2007/05/1668.pdf (2007)
3. 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)
4. Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.A.: Network formulations of mixed-integer programs. Math. Oper. Res. 34, 194–209 (2009)
5. Conforti, M., Wolsey, L.A., Zambelli, G.: Projecting an extended formulation for mixed-integer covers on bipartite graphs. Math. Oper. Res. 35, 603–623 (2010)