1. Balakrishnan, N./Wong, R.T. (1990): A network model for the rotating workforce scheduling problem. in: Networks 20, 25–42.
2. Balas, E./Carrera, M.C. (1996): A dynamic subgradient-based branch-and-bound procedure for set covering. in: Operations Research 44, 875–890.
3. Balas, E./Ho, A. (1980): Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. in: Mathematical Programming Study 12, 37–60.
4. Barnhart, C./Johnson, E.L./Nemhauser, G.L./ Savelsbergh, M.W.P./ Vance, P.H. (1994): Branch-and-price: column generation for solving huge integer programs, in: Birge, J.R./Murty, K.G. (eds.): Mathematical Programming: State of the Art 1994, 186–207. (The University of Michigan Press) Ann Arbor.
5. Beasley, J.E. (1987): An algorithm for set covering problems. in: European Journal of Operational Research 31, 85–93.