1. E. Balas and M. Padberg, “On the set covering problem,”Operations Research 20 (1972) 1152–1161.
2. V. Chvátal, “On certain polytopes associated with graphs,”Journal of Combinatorial Theory B 18 (1975) 138–154.
3. R. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).
4. Y. Ikura and G.L. Nemhauser, “An efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs,”Annals of Discrete Mathematics 16 (1982) 149–168.
5. V.A. Trubin, “On a method of solution of integer linear programming problems of a special kind,”Soviet Mathematics Doklady 10 (1969) 1544–1546.