Boltzmann machines as a model for parallel annealing

E.H.L. Aarts, J.H.M. Korst

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The potential of Boltzmann machines to cope with difficult combinatorial optimization problems is investigated. A discussion of various (parallel) models of Boltzmann machines is given based on the theory of Markov chains. A general strategy is presented for solving (approximately) combinatorial optimization problems with a Boltzmann machine. The strategy is illustrated by discussing the details for two different problems, namely MATCHING and GRAPH PARTITIONING.
Original languageEnglish
Pages (from-to)437-465
Number of pages29
JournalAlgorithmica
Volume6
Issue number3
DOIs
Publication statusPublished - 1991
Externally publishedYes

Fingerprint Dive into the research topics of 'Boltzmann machines as a model for parallel annealing'. Together they form a unique fingerprint.

Cite this