Go to content
UR Home

Bouncing towards the optimum: Improving the results of Monte Carlo optimization algorithms

DOI to cite this document:
Schneider, Johannes ; Morgenstern, Ingo ; Singer, Johannes Maria
(305kB) - Repository staff only
Date of publication of this fulltext: 09 Aug 2010 12:13


Simulated annealing and related Monte Carlo-type optimization algorithms are used to apply statistical physics concepts, in particular ideas from the statistical mechanics of spin glasses, to find optimal configurations for combinatorial optimization problems. There are formal proofs showing that these algorithms converge asymptotically (i.e.—possibly—for infinitely long simulation times) to a ...


Owner only: item control page
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons