The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Default user image.

Bo Söderberg

Teaching staff

Default user image.

Deterministic Annealing and Nonlinear Assignment

Author

  • Bo Söderberg
  • Henrik Jönsson

Summary, in Swedish

For combinatorial optimization problems that can be formulated as Ising or Potts spin systems, the Mean Field (MF) approximation yields a versatile and simple ANN heuristic, Deterministic Annealing. For problems involving assignments (or permutations), the situation is more complex -- the natural analog of the MF approximation lacks the simplicity present in the Potts and Ising cases. In this article the difficulties associated with this issue are investigated, and the options for solving them discussed. Improvements to existing Potts-based MF-inspired heuristics are suggested, and the possibilities for defining a proper variational approach are scrutinized.

Department/s

  • Computational Biology and Biological Physics - Has been reorganised

Publishing year

2001

Language

English

Publication/Series

LU TP

Document type

Report

Publisher

Lund University

Status

Published

Report number

01-16