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

Boltzmann Machine
Combinatorial optimization
Annealing
Combinatorial Optimization Problem
Markov processes
Markov chain
Model
Strategy

Cite this

Aarts, E.H.L. ; Korst, J.H.M. / Boltzmann machines as a model for parallel annealing. In: Algorithmica. 1991 ; Vol. 6, No. 3. pp. 437-465.
@article{945ec50ca8a641ac995cbc445cccd0a8,
title = "Boltzmann machines as a model for parallel annealing",
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.",
author = "E.H.L. Aarts and J.H.M. Korst",
year = "1991",
doi = "10.1007/BF01759053",
language = "English",
volume = "6",
pages = "437--465",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",

}

Boltzmann machines as a model for parallel annealing. / Aarts, E.H.L.; Korst, J.H.M.

In: Algorithmica, Vol. 6, No. 3, 1991, p. 437-465.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Boltzmann machines as a model for parallel annealing

AU - Aarts, E.H.L.

AU - Korst, J.H.M.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

U2 - 10.1007/BF01759053

DO - 10.1007/BF01759053

M3 - Article

VL - 6

SP - 437

EP - 465

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3

ER -