1. CHVATAL.V. (1985) Cutting planes and combinatorics. European Journal of combinatorics, 6, 217–26.
2. DAKIN.R.J. (1965) A tree search algorithm for mixed integer programming problems. The Computer Journal, 8, 250–255.
3. DAMICH.P.D, KANNAN.R and TROTTER.L. (1987) Hermite normal form computation using modulo determinant arithmetic. Math operat Research, 12.1, 50–59.
4. GAREY.M and JOHNSSON.D. (1979) Computer and intractability. W.Freeman and Co, N.Y.
5. GLOVER.F. (1966–7) “Generalized cuts in diophantine programming. Management Sciences, 13, 254–68.