Deterministic Annealing and Nonlinear Assignment

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 assignment problems 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.
15 pages, 3 figures

Keywords

Disordered Systems and Neural Networks, Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/17744

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0105321
 http://arxiv.org/abs/cond-mat/0105321

Collections

arXiv