Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > EXPECTED OPTIMIZATION TIME:
Reports tagged with expected optimization time:
TR04-089 | 26th October 2004
Ingo Wegener

Simulated Annealing Beats Metropolis in Combinatorial Optimization

The Metropolis algorithm is simulated annealing with a fixed temperature.Surprisingly enough, many problems cannot be solved more efficiently by simulated annealing than by the Metropolis algorithm with the best temperature. The problem of finding a natural example (artificial examples are known) where simulated annealing outperforms the Metropolis algorithm for all ... more >>>




ISSN 1433-8092 | Imprint