Date of Defense
4-1990
Department
Computer Science
Abstract
This chapter presents the traveling salesperson problem as an example of combinatorial optimization, introduces simulated annealing as a category of approximation algorithms, and explains how the Boltzmann machine is a biologically inspired implementation of simulated annealing. An example is given of how a Boltzmann Machine can be used to get approximate solutions to the traveling salesperson problem.
Recommended Citation
Tesar, Bruce Benson, "Investigations of Parallel Implementations of Boltzmann Machines" (1990). Honors Theses. 1497.
https://scholarworks.wmich.edu/honors_theses/1497
Access Setting
Honors Thesis-Campus Only
COinS