1. Murty, K. G.,Linear and Combinatorial Programming, John Wiley and Sons, New York, New York, 1976.
2. Technical Report;Y. Fathi,1978
3. Murty, K. G.,Computational Complexity of Complementary Pivot Methods, Mathematical Programming Study, Vol. 7, pp. 61?73, 1978.
4. Garey, M. R., andJohnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, California, 1979.
5. Karp, R. M.,Reducibility among Combinatorial Problems, Complexity of Computer Computation, Edited by R. E. Miller and J. W. Thatcher, Plenum Press, New York, New York, pp. 85?103, 1972.