Abstract
Chip insertion problems arise naturally in electronic board assembly. Several examples are considered and the problem is formulated as a travelling salesman problem. Microcomputer solutions are possible using the TRAVEL package of Boyd, Pulleyblank, and Cornuejols which provides inexpensive solutions to symmetric problems with less than 300 cities.