1. F.B. Akhmedov, ?Methods for Reducing the Dimension of the Binary Programming Problems,? Dissertation for the degree of The Candidate of Physico-Mathematical Sciences Institute of Cybernetics of The Academy of Sciences of Azerbaijan, Baku, 1985 (Russian).
2. A.L. Brearly, G. Mitra, and H.P. Williams, ?Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm,? Mathematical Programming,8, (1975), 54?83.
3. H. Crowder, E.L., Johnson, and M. Padberg ?Solving Large-Scale Zero-One Linear Programming Problems? Operat. Res. 1983, v 5, N5, 266?277.
4. I.V. Danilchenko, Yu.M. Makarenkov, and E.F. Pshennova, ?A Method of Preliminary Reducing the Dimension of the Linear Programming Problem with Non-negative Constraints Matrix,? Cybernetics, 1980, N 3, 103?106 (Translated from Russian).
5. Discrete Optimization II. Ann. Discrete Math.;J.J. Forrest,1979