Systematic Generation of Hamiltonian Circuits For a combinatorial matrix which may specify both directed and nondirected arcs, the paper describes a computer program which generates systematically and exhaustively all the Hamiltonian circuits. Specific application is made to the "traveling salesman" problem. CACM September, 1966 Roberts, S. M. CA660911 JB March 2, 1978 4:30 PM 1368 5 1368 1368 5 1368 1368 5 1368