1. S. Baum and L.E. Trotter, Jr., “Integer rounding for polymatroid and branching optimization problems”,SIAM Journal on Algebraic and Discrete Methods 2 (1981) 416–425.
2. C. Berge and E.L. Johnson, “Coloring the edges of a hypergraph and linear programming techniques”, Research Report CORR 76/4, Department of Combinatorics and Optimization, University of Waterloo (Waterloo, Ontario, 1976).
3. D. Gale,The theory of linear economic models (McGraw-Hill, New York, 1960).
4. O. Marcotte, “Topics in combinatorial packing and covering”, Technical Report No. 568, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1982).