1. J.P. Arabeyre, J. Fearnley, F. Steiger and W. Teather, “The airline crew scheduling problem: A survey”,Transportation Science 3 (1969) 140–163.
2. E. Balas and M.W. Padberg, “On the set covering problem”,Operations Research 20 (1972) 1152–1161.
3. E. Balas and M.W. Padberg, “On the set covering problem II: An algorithm”, Management Sciences Research Report No. 278, GSIA, Carnegie—Mellon University, Pittsburgh, Pa. (presented at the Joint National Meeting of ORSA, TIMS, AIEE, at Atlantic City, November 8–10, 1972).
4. M.L. Balinski, “On recent developments in integer programming”, in:Proceedings of the Princeton Symposium on Mathematical Programming, Ed. H.W. Kuhn (Princeton University Press, Princeton, N.J., 1970).
5. M.L. Balinski, “On maximum matching, minimum covering and their connections”, in:Proceedings of the Princeton Symposium on Mathematical Programming, Ed. H.W. Kuhn (Princeton University Press, Princeton, N.J., 1970).