Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Default user image.

Carsten Peterson

Expert

Default user image.

Solving optimization problems with mean field methods

Författare

  • Carsten Peterson

Summary, in English

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. The mean field approximation is based on a variational principle, which also turns out to be very profitable when computing correlations in polymers.

Avdelning/ar

  • Department of Astronomy and Theoretical Physics

Publiceringsår

1993-11-15

Språk

Engelska

Sidor

570-580

Publikation/Tidskrift/Serie

Physica A: Statistical Mechanics and its Applications

Volym

200

Issue

1-4

Dokumenttyp

Artikel i tidskrift

Förlag

Elsevier

Ämne

  • Computational Mathematics

Aktiv

Published

ISBN/ISSN/Övrigt

  • ISSN: 0378-4371