Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!uwmcsd1!uxc!uxc.cso.uiuc.edu!a.cs.uiuc.edu!p.cs.uiuc.edu!gillies
From: gillies@p.cs.uiuc.edu
Newsgroups: comp.misc
Subject: Re: Looking for a Simulated annealing p
Message-ID: <79700015@p.cs.uiuc.edu>
Date: 31 Aug 88 01:31:00 GMT
Lines: 13
Nf-ID: #R:<8808291551.AA19924@columbia.edu:-33:p.cs.uiuc.edu:79700015:000:533
Nf-From: p.cs.uiuc.edu!gillies    Aug 30 20:31:00 1988


>Does someone know of a PD/cheap simulated annealing algorithm?

The answer is probably NO.  Simulated annealing is a TECHNIQUE, not
an algorithm.  It's like asking,

"Does someone know of a PD/cheap branch-and-bound algorithm?  Does
someone know of a PD/cheap dynamic programming algorithm?  Does someone
know of a PD/cheap alpha-beta tree-pruning algorithm?"

You can't employ simulated annealing unless you know what the problem
domain is (VLSI, Distributed Systems, some particular NP-complete
problem from Garey & Johnson, etc).