1. Beasley, J.E. (1990): A Lagrangean heuristic for Set Covering problems. in: Naval Research Logistics 37, 151 – 164
2. Balash, E./Carrera, M.C. (1996): A dynamic subgradient based branch and bound procedure for set covering. in: Operations Research 44 (6), 875 – 890
3. Balash, E./Ho A. (1980): Set Covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. In: Mathematical Programming 12, 37 – 60
4. Ball, M./Bodin, L./Dial, R. (1983): A matching based heuristic for scheduling mass transit crews and vehicles. in: Transportation Science 17, 4 – 13
5. Bertossi, B./Carraresi, P./Gallo, G. (1987): On some matching problems arising in vehicle scheduling models. in: Networks 17, 271 – 281