Thumbnail
Access Restriction
Subscribed

Author Roberts, S. M. ♦ Flores, Benito
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: Univ. of Houston, TX (Flores, Benito) || IBM Corp., Houston, TX (Roberts, S. M.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 9
Issue Number 9
Page Count 5
Starting Page 690
Ending Page 694


Open content in new tab

   Open content in new tab
Source: ACM Digital Library