1. Al-Khayyal, F.A. An implicit enumeration algorithm for the general linear complementarity problem. Tech. Report, School of Indust. and Syst. Engin., The Georgia Inst. of Technology (1985).
2. Balinski, M.L. An algorithm for finding all vertices of polyhedral sets. J. Soc. Indust. Appl. Math. 9 (1961), 72–89.
3. Bazara, M.S. and Sherali, H.D. A versatile scheme for ranking the extreme points of an assignment polytope. Naval Research Log. Quart. Vol. 28 (1981), No. 4.
4. Cabot, V.A. and Francis, R.L. Solving certain nonconvex quadratic minimization problems by ranking the extreme points. Operations Research, Vol. 18 (1970), 82–86.
5. Chvatal, V. Linear Programming. Freeman N.Y. (1983)