1. N. AGIN (1966) Optimum seeking with branch-and-bound. Management Sci. 13, B176–185.
2. E. GALAS (1968) A note on the branch-and-bound principle. Operations Res. 16, 442–445, 886.
3. W. BARTH (1968) Ein ALGOL 60 Programm zur Lósung des traveling Salesman Problems. Ablauf-and Planungsforschung 9, 99–105.
4. J.R. BITNER, G. EHRLICH, E.M. REINGOLD (1976) Efficient generation of the binary reflected Gray code and its applications. Comm. ACM 19,517–521. N.
5. DERSHOWITZ (1975) A simplified loop-free algorithm for generating permutations. BIT 15, 158–164.