Abstract
Simulated annealing is a stochastic optimization procedure which is widely applicable and has been found effective in several problems arising in computeraided circuit design. This paper derives the method in the context of traditional optimization heuristics and presents experimental studies of its computational efficiency when applied to graph partitioning and traveling salesman problems.
| Original language | English |
|---|---|
| Pages (from-to) | 975-986 |
| Number of pages | 12 |
| Journal | Journal of Statistical Physics |
| Volume | 34 |
| Issue number | 5-6 |
| DOIs | |
| State | Published - Mar 1984 |
| Externally published | Yes |
Keywords
- Spin glasses
- algorithms
- graph partitioning
- optimization
Fingerprint
Dive into the research topics of 'Optimization by simulated annealing: Quantitative studies'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver