Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Roberts et al. (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: