Solving optimization problems with mean field methods

Carsten Peterson

Physica A: Statistical Mechanics and its Applications, 1993, vol. 200, issue 1, 570-580

Abstract: A brief review is given for the use of feed-back artificial neural networks (ANN) to obtain good approximate solutions to combinatorial optimization problems. The key element is the mean field approximation (MFT), which differs from conventional methods and “feels” its ways towards good solutions rather than fully or partly exploring different possible solutions. The methodology, which is illustrated for the graphs bisection and knapsack problems, is easily generalized to Potts systems. The latter is related to the deformable templates method, which is illustrated with the track finding problem.

Date: 1993
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/037843719390562I
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:200:y:1993:i:1:p:570-580

DOI: 10.1016/0378-4371(93)90562-I

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().