1. Aardal, K., 1992. On the solution of one and two-level capacitated facility location problems by the cutting plane approach. Ph.D. Thesis, Université Catholique de Louvain (Louvain-la-Neuve).
2. Aardal, K., Pochet, Y., Wolsey, L.A., 1995. Capacitated facility location: Valid inequalities and facets. Mathematics of Operations Research 20, 562–582.
3. Bienstock, D., Günlük, O., 1994. Capacitated network design — Polyhedral structure and computation. Working Paper, Columbia University (to appear in INFORMS Journal on Computing).
4. Cho, D.C., Johnson, E.L., Padberg, M.W., Rao, M.R., 1983a. On the uncapacitated plant location problem. I: Valid inequalities and facets. Mathematics of Operations Research 8, 579–589.
5. Cho, D.C., Padberg, M.W., Rao, M.R., 1983b. On the uncapacitated plant location problem. II: Facets and lifting theorems. Mathematics of Operations Research 8, 590–612.