On Simulated Annealing and Nested Annealing

Journal of Global Optimization

Volumn 16, Issue 1, 2000, Pages 43-56

  Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346111806     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008307523936     Document Type: Article

References (14)

1. Bollobás, B. (1985), Random Graphs, Published by Academic Press.
2. ElGamal, A., and Shperling, I. (1984), Design of Good Codes via Simulated Annealing, List of Abstracts, Workshop on Statistical Physics in Engineering and Biology, Yorktown Heights, NY.
3. Feller, W. (1966), An Introduction to Probability Theory and Its Applications, Volumes I and II, Published by John Wiley and Sons.
4. Garey, M. and Johnson, D. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Published by W.H. Freeman & Co., New York.
5. Golden, B.L. and Skiscim, C.C. (1986), Using Simulated Annealing to solve Routing and Location Problems, Naval Research Logistics Quarterly, 33, pp. 261-279.
6. Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C. (1987), Optimization by Simulated Annealing: An Experimental Evaluation (Part I), Preliminary Draft, AT & T Bell Labs., Murray Hill, NJ.
7. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983), Optimization by Simulated Annealing, Science.
8. Lipton, R.J. and Tarjan, R.E. (1980), Applications of a Planar Separator Theorem, SIAM J. Comput. 9(3).
9. Lipton, R.J. and Tarjan, R.E. (1979), A Planar Separator Theorem, SIAM J. Appal. Math. 36(2).
10. Mitra, D., Romeo, F. and Vincentelli, A.S. (1986), Convergence and Finite-Time Behavior of Simulated Annealing, Advances in Appal. Probability.
11. Rabin, M.O. (1976), Probabilistic Algorithms, in: Traub, J.F., ed., Algorithms and Complexity, Academic Press, New York, 1976. pp. 21-36.
12. Rajasekaran, S. and Reif, J.H. (1988), Nested Annealing: A Provable Improvement to Simulated Annealing, Proc. ICALP 1988. Also submitted to Theoretical Computer Science.
13. Solovay, R. and Strassen, v. (1977), A Fast Monte-Carlo Test for Primarily, SIAM J. Computing 6, 84-85.
14. Vecchi, M.P. and Kirkpatrick, S., Global Wiring by Simulated Annealing, Technical Report, IBM Thomas J. Watson Research Center, New York, pp. 10598.