1. E.M.L. Beale and R.E. Small, “Mixed integer programming by a branch and bound technique”, in: W.H. Kalenich, ed.,Proceedings of the IFIP congress 65, Vol. 2 (1966) pp. 450–451.
2. E.M.L. Beale and J.A. Tomlin,” Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables”, in:Proceedings of the 5th IFORS conference 1969 (Tavistock Publications London).
3. M. Bénichou, J.M. Gauthier, P. Girodet, G. Hentges, G. Ribière and O. Vincent, “Experiments in mixed-integer linear programming”,Mathematical Programming 1 (1971) 76–94.
4. R. Breu and C.A. Burdet, “Branch and bound experiments in 0–1 programming”,Mathematical Programming Study 2 (1974) 1–50.
5. R.J. Dakin, “A tree search algorithm for mixed integer programming problems”,The Computer Journal 8 (1965) 250–255.