| Article ID: | iaor1989565 |
| Country: | United Kingdom |
| Volume: | 27 |
| Issue: | 10 |
| Start Page Number: | 1837 |
| End Page Number: | 1841 |
| Publication Date: | Oct 1989 |
| Journal: | International Journal of Production Research |
| Authors: | Chan Donald, Mercier Daniel |
| Keywords: | programming: network, programming: travelling salesman |
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.