Abstract
The problem of finding the shortest closed path connecting N randomly chosen points is one of the classic Np-complete problems. We show that the length of tour depends logarithmically on the cooling rate Q in a simulated Monte Carlo anneal. We speculate that this is a general property of all Np-complete problems. © 1986 Plenum Publishing Corporation.
| Original language | English |
|---|---|
| Pages (from-to) | 885-890 |
| Number of pages | 6 |
| Journal | Journal of Statistical Physics |
| Volume | 45 |
| Issue number | 5-6 |
| DOIs | |
| State | Published - Dec 1 1986 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'N-city traveling salesman problem: Optimization by simulated annealings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver