{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T12:05:49Z","timestamp":1773662749538,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759051","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"367-418","source":"Crossref","is-referenced-by-count":76,"title":["Efficient simulated annealing on fractal energy landscapes"],"prefix":"10.1007","volume":"6","author":[{"given":"Gregory B.","family":"Sorkin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01759051_CR1","unstructured":"C. Aragon, D. Johnson, L. McGeoch, and C. Schevon. Simulated annealing performance studies. InWorkshop on Statistical Physics in Engineering and Biology, April 1984. (Also: D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning.Operations Research, 37(6): 865\u2013892, 1989.)"},{"key":"BF01759051_CR2","volume-title":"S: An Interactive Environment for Data Analysis","author":"R. A. Becker","year":"1984","unstructured":"R. A. Becker and J. M. Chambers.S: An Interactive Environment for Data Analysis. Wadsworth, Belmont, CA, 1984."},{"key":"BF01759051_CR3","volume-title":"Time Series: Data Analysis and Theory","author":"D. R. Brillinger","year":"1981","unstructured":"D. R. Brillinger.Time Series: Data Analysis and Theory. Holden-Day, San Francisco, CA, 1981."},{"key":"BF01759051_CR4","doi-asserted-by":"crossref","unstructured":"P. Dagum, M. Luby, M. Mihail, and U. Vazirani. Polytopes, permanents, and graphs with large factors. InProceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 412\u2013421, 1988.","DOI":"10.1109\/SFCS.1988.21957"},{"key":"BF01759051_CR5","doi-asserted-by":"crossref","unstructured":"P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of Markov chains. Unpublished manuscript, 1990.","DOI":"10.1214\/aoap\/1177005980"},{"key":"BF01759051_CR6","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images.IEEE Transactions on Pattern Analysis and Machine Intelligence, 6: 721\u2013741, 1984.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"BF01759051_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"B. Hajek. Cooling schedules for optimal annealing.Mathematics of Operations Research, 13(2): 311\u2013329, May 1988.","journal-title":"Mathematics of Operations Research"},{"key":"BF01759051_CR8","volume-title":"Coding and Information Theory","author":"R. W. Hamming","year":"1986","unstructured":"R. W. Hamming.Coding and Information Theory, 2nd edn. Prentice-Hall, Englewood Cliffs, NJ, 1986.","edition":"2nd edn."},{"issue":"2","key":"BF01759051_CR9","first-page":"117","volume":"2","author":"W. Heller","year":"1978","unstructured":"W. Heller, W. F. Mikhail, and W. E. Donath. Prediction of wire space requirements for LSI.Journal of Design Automation and Fault-Tolerant Computing, 2(2): 117\u2013144, May 1978.","journal-title":"Journal of Design Automation and Fault-Tolerant Computing"},{"key":"BF01759051_CR10","doi-asserted-by":"crossref","unstructured":"M. R. Jerrum and A. Sinclair. Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved. InProceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 235\u2013244, 1988.","DOI":"10.1145\/62212.62234"},{"issue":"4598","key":"BF01759051_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. D. Gelatt, Jr., and M. Vecchi. Optimization by simulated annealing.Science, 220(4598): 671\u2013680, May 1983.","journal-title":"Science"},{"key":"BF01759051_CR12","unstructured":"S. Kirkpatrick and G. Toulouse. Configuration space analysis of traveling salesman problems. RC 10972 (#49218), I.B.M, Jan. 1985."},{"key":"BF01759051_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M. Lundy","year":"1986","unstructured":"M. Lundy and A. Mees. Convergence of the annealing algorithm.Mathematical Programming, 34:111\u2013124, 1986.","journal-title":"Mathematical Programming"},{"key":"BF01759051_CR14","doi-asserted-by":"crossref","unstructured":"M. Mihail. Conductance and convergence of Markov chains: A combinatorial treatment of expanders. InProceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 526\u2013531, 1989.","DOI":"10.1109\/SFCS.1989.63529"},{"key":"BF01759051_CR15","doi-asserted-by":"crossref","first-page":"747","DOI":"10.2307\/1427186","volume":"18","author":"D. Mitra","year":"1986","unstructured":"D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli. Convergence and finite-time behavior of simulated annealing.Advances in Applied Probability, 18: 747\u2013771, 1986.","journal-title":"Advances in Applied Probability"},{"key":"BF01759051_CR16","unstructured":"F. I. Romeo,Simulated Annealing: Theory and Applications to Layout Problems. Ph.D. thesis, University of California at Berkeley, March 1989. Memorandum No. UCB\/ERL M89\/29."},{"key":"BF01759051_CR17","unstructured":"F. Romeo and A. Sangiovanni-Vincentelli. Probabilistic hill climbing algorithms. In 7955Chapel Hill Conference on Very Large Scale Integration, pages 393\u2013417, 1985."},{"key":"BF01759051_CR18","volume-title":"Stochastic Processes","author":"S. R. Ross","year":"1946","unstructured":"S. R. Ross.Stochastic Processes. Wiley, New York, NY, 1946."},{"key":"BF01759051_CR19","volume-title":"The Science of Fractal Images","author":"D. Saupe","year":"1988","unstructured":"D. Saupe. Algorithms for random fractals. In H.-O. Peitgen and D. Saupe, editors,The Science of Fractal Images, Chapter 2, pages 71\u2013136. Springer-Verlag, New York, 1988."},{"key":"BF01759051_CR20","doi-asserted-by":"crossref","unstructured":"C. Sechen and A. Sangiovanni-Vincentelli. Timberwolf 3.2: A new standard cell placement and global routing package. InProceedings of the 23rd Design Automation Conference, pages 432\u2013439, 1986.","DOI":"10.1109\/DAC.1986.1586125"},{"key":"BF01759051_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A. Sinclair","year":"1989","unstructured":"A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains.Information and Computation, 82: 93\u2013133, 1989.","journal-title":"Information and Computation"},{"key":"BF01759051_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-642-82657-3_28","volume-title":"Disordered Systems and Biological Organization","author":"S. A. Solla","year":"1986","unstructured":"S. A. Solla, G. B. Sorkin, and S. R. White. Configuration space analysis for optimization problems. In E. Bienenstock, F. Fogelmansoulie, and G. Weisbuch, editors,Disordered Systems and Biological Organization, pages 283\u2013292. Springer-Verlag, New York, 1986."},{"key":"BF01759051_CR23","unstructured":"G. B. Sorkin. Combinatorial optimization, simulated annealing, and fractals. RC 13674.1.B.M., April 1988."},{"key":"BF01759051_CR24","unstructured":"G. B. Sorkin. Bivariate time series analysis of simulated annealing data. Technical Report UCB\/ ERL M90\/6, University of California at Berkeley, Jan. 1990."},{"key":"BF01759051_CR25","unstructured":"G. B. Sorkin. Efficiency of simulated annealing: Analysis by rapidly-mixing Markov chains and results for fractal landscapes. Technical Report UCB\/ERL M91\/12, University of California at Berkeley, February 1991."},{"key":"BF01759051_CR26","unstructured":"G. B. Sorkin.Theory and Practice of Simulated Annealing on Fractal Landscapes Ph.D. thesis, University of California at Berkeley, 1991. In preparation."},{"key":"BF01759051_CR27","volume-title":"The Science of Fractal Images","author":"R. F. Voss","year":"1988","unstructured":"R. F. Voss. Fractals in nature: From characterization to simulation. In H.-O. Peitgen and D. Saupe, editors,The Science of Fractal Images, Chapter 1, pages 21\u201370. Springer-Verlag, New York, 1988."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759051\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:27:12Z","timestamp":1586287632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":27,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759051"],"URL":"https:\/\/doi.org\/10.1007\/bf01759051","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}