{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T18:59:40Z","timestamp":1761418780248},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T00:00:00Z","timestamp":1328572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10898-012-9860-0","type":"journal-article","created":{"date-parts":[[2012,2,6]],"date-time":"2012-02-06T14:33:52Z","timestamp":1328538832000},"page":"185-215","source":"Crossref","is-referenced-by-count":26,"title":["From simulated annealing to stochastic continuation: a new trend in combinatorial optimization"],"prefix":"10.1007","volume":"56","author":[{"given":"Marc C.","family":"Robini","sequence":"first","affiliation":[]},{"given":"Pierre-Jean","family":"Reissman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,7]]},"reference":[{"issue":"1\/2","key":"9860_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01022991","volume":"50","author":"E.H.L. Aarts","year":"1988","unstructured":"Aarts E.H.L., Korst J.M., van Laarhoven P.J.M.: A quantitative analysis of the simulated annealing algorithm: a case study for the traveling salesman problem. J. Stat. Phys. 50(1\/2), 187\u2013206 (1988)","journal-title":"J. Stat. Phys."},{"key":"9860_CR2","first-page":"363","volume-title":"Simulated Annealing","author":"S. Alizamir","year":"2008","unstructured":"Alizamir S., Rebennack S., Pardalos P.: Improving the neighborhood selection strategy in simulated annealing using optimal stopping problem. In: Tan, C. (eds) Simulated Annealing, pp. 363\u2013382. I-Tech Education and Publishing, Austria (2008)"},{"issue":"4","key":"9860_CR3","doi-asserted-by":"crossref","first-page":"885","DOI":"10.2307\/3214721","volume":"29","author":"C. B\u00e9lisle","year":"1992","unstructured":"B\u00e9lisle C.: Convergence theorems for a class of simulated annealing algorithms on $${\\mathbb{R}^d}$$ . J. Appl. Probab. 29(4), 885\u2013895 (1992)","journal-title":"J. Appl. Probab."},{"key":"9860_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","volume-title":"Visual Reconstruction","author":"A. Blake","year":"1987","unstructured":"Blake A., Zisserman A.: Visual Reconstruction. MIT Press, Cambridge (1987)"},{"key":"9860_CR5","volume-title":"Modern Multidimensional Scaling","author":"I. Borg","year":"2009","unstructured":"Borg I., Groenen P.: Modern Multidimensional Scaling. Springer, Berlin (2009)"},{"key":"9860_CR6","doi-asserted-by":"crossref","unstructured":"Brandenburg, F., Himsolt, M., Rohrer, C.: An experimental comparison of force-directed and randomized graph drawing algorithms. In: Proceedings of the 1995 Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 1027, pp. 76\u201387. Springer, Berlin (1996)","DOI":"10.1007\/BFb0021792"},{"issue":"3","key":"9860_CR7","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/TITB.2006.872073","volume":"10","author":"K. Bryan","year":"2006","unstructured":"Bryan K., Cunningham P., Bolshakova N.: Application of simulated annealing to the biclustering of gene expression data. IEEE Trans. Inf. Technol. Biomed. 10(3), 519\u2013525 (2006)","journal-title":"IEEE Trans. Inf. Technol. Biomed."},{"key":"9860_CR8","first-page":"535","volume":"307","author":"O. Catoni","year":"1988","unstructured":"Catoni O.: Large deviations and cooling schedules for the simulated annealing algorithm (in french). C. R. Acad. Sci. Paris S\u00e9r. I Math. 307, 535\u2013538 (1988)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."},{"issue":"3","key":"9860_CR9","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1214\/aop\/1176989682","volume":"20","author":"O. Catoni","year":"1992","unstructured":"Catoni O.: Rough large deviation estimates for simulated annealing: application to exponential schedules. Ann. Probab. 20(3), 1109\u20131146 (1992)","journal-title":"Ann. Probab."},{"issue":"4","key":"9860_CR10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1006\/jcom.1996.0035","volume":"12","author":"O. Catoni","year":"1996","unstructured":"Catoni O.: Metropolis, simulated annealing, and iterated energy transformation algorithms: theory and experiments. J. Complex. 12(4), 595\u2013623 (1996)","journal-title":"J. Complex."},{"issue":"5","key":"9860_CR11","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1137\/S0363012996307813","volume":"36","author":"O. Catoni","year":"1998","unstructured":"Catoni O.: Solving scheduling problems by simulated annealing. SIAM J. Control Optim. 36(5), 1539\u20131575 (1998)","journal-title":"SIAM J. Control Optim."},{"key":"9860_CR12","doi-asserted-by":"crossref","unstructured":"Catoni, O.: Simulated annealing algorithms and Markov chains with rare transitions. In: Azema, J., Emery, M., Ledoux, M., Yor, M. (eds) S\u00e9minaire de probabilit\u00e9s XXXIII, Lecture Notes in Mathematics, vol. 1709, pp. 69\u2013119. Springer, New York (1999)","DOI":"10.1007\/BFb0096510"},{"issue":"6","key":"9860_CR13","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1137\/0326084","volume":"26","author":"T.S. Chiang","year":"1988","unstructured":"Chiang T.S., Chow Y.: On the convergence rate of annealing processes. SIAM J. Control Optim. 26(6), 1455\u20131470 (1988)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"9860_CR14","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/S1052623497329683","volume":"9","author":"H. Cohn","year":"1999","unstructured":"Cohn H., Fielding M.: Simulated annealing: searching for an optimal temperature schedule. SIAM J. Optim. 9(3), 779\u2013802 (1999)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9860_CR15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1214\/aoap\/1028903532","volume":"8","author":"C. Cot","year":"1998","unstructured":"Cot C., Catoni O.: Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms. Ann. Appl. Probab. 8(2), 375\u2013396 (1998)","journal-title":"Ann. Appl. Probab."},{"issue":"4","key":"9860_CR16","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson R., Harel D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15(4), 301\u2013331 (1996)","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"9860_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02618466","volume":"9","author":"S. Amorim de","year":"1992","unstructured":"de Amorim S., Barth\u00e9lemy J.P., Ribeiro C.: Clustering and clique partitioning: simulated annealing and tabu search approaches. J. Classif. 9(1), 17\u201341 (1992)","journal-title":"J. Classif."},{"issue":"4","key":"9860_CR18","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1137\/S0363012996313987","volume":"37","author":"P. Del Moral","year":"1999","unstructured":"Del Moral P., Miclo L.: On the convergence and applications of generalized simulated annealing. SIAM J. Control Optim. 37(4), 1222\u20131250 (1999)","journal-title":"SIAM J. Control Optim."},{"issue":"4\u20135","key":"9860_CR19","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF02823146","volume":"24","author":"M. Desai","year":"1999","unstructured":"Desai M.: Some results characterizing the finite time behaviour of the simulated annealing algorithm. S\u0101dhan\u0101 24(4\u20135), 317\u2013337 (1999)","journal-title":"S\u0101dhan\u0101"},{"issue":"2","key":"9860_CR20","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S1052623499363955","volume":"11","author":"M. Fielding","year":"2000","unstructured":"Fielding M.: Simulated annealing with an optimal fixed temperature. SIAM J. Optim. 11(2), 289\u2013307 (2000)","journal-title":"SIAM J. Optim."},{"key":"9860_CR21","doi-asserted-by":"crossref","unstructured":"Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Proceedings of the 1994 Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 894, pp. 388\u2013403. Springer, Berlin (1995)","DOI":"10.1007\/3-540-58950-3_393"},{"key":"9860_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03025711","volume":"213","author":"A. Frigerio","year":"1993","unstructured":"Frigerio A., Grillo G.: Simulated annealing with time-dependent energy function. Math. Z. 213, 97\u2013116 (1993)","journal-title":"Math. Z."},{"issue":"11","key":"9860_CR23","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman T.M.J., Reingold E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"1","key":"9860_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0331009","volume":"31","author":"S. Gelfand","year":"1993","unstructured":"Gelfand S., Mitter S.: Metropolis-type annealing algorithms for global optimization in $${\\mathbb{R}^d}$$ . SIAM J. Control Optim. 31(1), 111\u2013131 (1993)","journal-title":"SIAM J. Control Optim."},{"issue":"1\/2","key":"9860_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01007975","volume":"39","author":"B. Gidas","year":"1985","unstructured":"Gidas B.: Nonstationary Markov chains and convergence of the annealing algorithm. J. Stat. Phys. 39(1\/2), 73\u2013131 (1985)","journal-title":"J. Stat. Phys."},{"issue":"3","key":"9860_CR26","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF02294553","volume":"61","author":"P. Groenen","year":"1996","unstructured":"Groenen P., Heiser W.: The tunneling method for global optimization in multidimensional scaling. Psychometrika 61(3), 529\u2013550 (1996)","journal-title":"Psychometrika"},{"issue":"4","key":"9860_CR27","doi-asserted-by":"crossref","first-page":"866","DOI":"10.2307\/1427681","volume":"23","author":"H. Haario","year":"1991","unstructured":"Haario H., Saksman E.: Simulated annealing process in general state space. Adv. Appl. Probab. 23(4), 866\u2013893 (1991)","journal-title":"Adv. Appl. Probab."},{"issue":"2","key":"9860_CR28","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"Hajek B.: Cooling schedules for optimal annealing. Math. Oper. Res. 13(2), 311\u2013329 (1988)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9860_CR29","doi-asserted-by":"crossref","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D. Harel","year":"2002","unstructured":"Harel D., Koren Y.: A fast multi-scale method for drawing large graphs. J. Graph Algorithms Appl. 6(3), 179\u2013202 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"9860_CR30","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1023\/B:HEUR.0000034712.48917.a9","volume":"10","author":"S. Jacobson","year":"2004","unstructured":"Jacobson S., Yuc\u00ebsan E.: Analyzing the performance of generalized hill climbing algorithms. J. Heuristics 10(4), 387\u2013405 (2004)","journal-title":"J. Heuristics"},{"issue":"1\u20132","key":"9860_CR31","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0166-218X(01)00264-5","volume":"119","author":"A. Johnson","year":"2002","unstructured":"Johnson A., Jacobson S.: On the convergence of generalized hill climbing algorithms. Discrete Appl. Math. 119(1\u20132), 37\u201357 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"9860_CR32","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D. Johnson","year":"1989","unstructured":"Johnson D., Aragon C., McGeoch L., Shevon C.: Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper. Res. 37(6), 865\u2013892 (1989)","journal-title":"Oper. Res."},{"issue":"5","key":"9860_CR33","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/34.134041","volume":"13","author":"V. Johnson","year":"1991","unstructured":"Johnson V., Wong W., Hu X., Chen C.T.: Image restoration using Gibbs priors: boundary modeling, treatment of blurring, and selection of hyperparameters. IEEE Trans. Pattern Anal. Mach. Intell. 13(5), 413\u2013425 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"9860_CR34","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada T., Kawai S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"9860_CR35","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, vol. 2025. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44969-8"},{"issue":"4598","key":"9860_CR36","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S., Gelatt C.D., Vecchi M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"4","key":"9860_CR37","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.2307\/3214991","volume":"33","author":"M. Locatelli","year":"1996","unstructured":"Locatelli M.: Convergence properties of simulated annealing for continuous global optimization. J. Appl. Probab. 33(4), 1127\u20131140 (1996)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"9860_CR38","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1004680806815","volume":"104","author":"M. Locatelli","year":"2000","unstructured":"Locatelli M.: Simulated annealing algorithms for continuous global optimization: convergence conditions. J. Optim. Theory Appl. 104(1), 121\u2013133 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9860_CR39","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-4149(96)00070-1","volume":"63","author":"M. L\u00f6we","year":"1996","unstructured":"L\u00f6we M.: Simulated annealing with time-dependent energy function via Sobolev inequalities. Stoch. Process. Appl. 63(2), 221\u2013233 (1996)","journal-title":"Stoch. Process. Appl."},{"issue":"5","key":"9860_CR40","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/34.589213","volume":"19","author":"M. Nielsen","year":"1997","unstructured":"Nielsen M.: Graduated nonconvexity by functional focusing. IEEE Trans. Pattern Anal. Mach. Intell. 19(5), 521\u2013525 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9860_CR41","first-page":"1","volume-title":"Handbook of Metaheuristics, International Series in Operations Research and Management Science, vol. 146","author":"A. Nikolaev","year":"2010","unstructured":"Nikolaev A., Jacobson S.: Simulated annealing. In: Gendreau, M., Potvin, J.Y. (eds) Handbook of Metaheuristics, International Series in Operations Research and Management Science, vol. 146, pp. 1\u201340. Springer, Berlin (2010)"},{"issue":"9","key":"9860_CR42","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/83.784433","volume":"8","author":"M. Nikolova","year":"1999","unstructured":"Nikolova M.: Markovian reconstruction using a GNC approach. IEEE Trans. Image Process. 8(9), 1204\u20131220 (1999)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"9860_CR43","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1287\/moor.1040.0095","volume":"29","author":"J. Ohlmann","year":"2004","unstructured":"Ohlmann J., Bean J., Henderson S.: Convergence in probability of compressed annealing. Math. Oper. Res. 29(4), 837\u2013860 (2004)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9860_CR44","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1019633214895","volume":"115","author":"J. Orosz","year":"2002","unstructured":"Orosz J., Jacobson S.: Analysis of static simulated annealing algorithms. J. Optim. Theory Appl. 115(1), 165\u2013182 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9860_CR45","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1013544329096","volume":"21","author":"J. Orosz","year":"2002","unstructured":"Orosz J., Jacobson S.: Finite-time performance analysis of static simulated annealing algorithms. Comput. Optim. Appl. 21(1), 21\u201353 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"9860_CR46","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","volume":"13","author":"H. Purchase","year":"2002","unstructured":"Purchase H.: Metrics for graph drawing aesthetics. J. Vis. Lang. Comput. 13(5), 501\u2013516 (2002)","journal-title":"J. Vis. Lang. Comput."},{"issue":"4","key":"9860_CR47","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1017\/S0269964802164035","volume":"16","author":"M.C. Robini","year":"2002","unstructured":"Robini M.C., Bresler Y., Magnin I.E.: On the convergence of Metropolis-type relaxation and annealing with constraints. Probab. Eng. Inf. Sci. 16(4), 427\u2013452 (2002)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"10","key":"9860_CR48","doi-asserted-by":"crossref","first-page":"2576","DOI":"10.1109\/TIP.2007.904975","volume":"16","author":"M.C. Robini","year":"2007","unstructured":"Robini M.C., Lachal A., Magnin I.E.: A stochastic continuation approach to piecewise constant reconstruction. IEEE Trans. Image Process. 16(10), 2576\u20132589 (2007)","journal-title":"IEEE Trans. Image Process."},{"issue":"8","key":"9860_CR49","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/TIP.2003.812330","volume":"12","author":"M.C. Robini","year":"2003","unstructured":"Robini M.C., Magnin I.E.: Stochastic nonlinear image restoration using the wavelet transform. IEEE Trans. Image Process. 12(8), 890\u2013905 (2003)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"9860_CR50","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1137\/090756181","volume":"3","author":"M.C. Robini","year":"2010","unstructured":"Robini M.C., Magnin I.E.: Optimization by stochastic continuation. SIAM J. Imaging Sci. 3(4), 1096\u20131121 (2010)","journal-title":"SIAM J. Imaging Sci."},{"issue":"10","key":"9860_CR51","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/83.791963","volume":"8","author":"M.C. Robini","year":"1999","unstructured":"Robini M.C., Rastello T., Magnin I.E.: Simulated annealing, acceleration techniques and image restoration. IEEE Trans. Image Process. 8(10), 1374\u20131387 (1999)","journal-title":"IEEE Trans. Image Process."},{"issue":"8","key":"9860_CR52","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1016\/j.spl.2011.04.003","volume":"81","author":"M.C. Robini","year":"2011","unstructured":"Robini M.C., Reissman P.J.: On simulated annealing with temperature-dependent energy and temperature-dependent communication. Stat. Probab. Lett. 81(8), 915\u2013920 (2011)","journal-title":"Stat. Probab. Lett."},{"issue":"2","key":"9860_CR53","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/moor.22.2.266","volume":"22","author":"P. Schuur","year":"1997","unstructured":"Schuur P.: Classification of acceptance criteria for the simulated annealing algorithm. Math. Oper. Res. 22(2), 266\u2013275 (1997)","journal-title":"Math. Oper. Res."},{"key":"9860_CR54","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"I. Tollis","year":"1999","unstructured":"Tollis I., Battista G.D., Eades P., Tamassia R.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs, NJ (1999)"},{"key":"9860_CR55","unstructured":"Trosset, M.: On the existence of nonglobal minimizers of the stress criterion for metric multidimensional scaling. In: Proceedings of the Statistical Computing Section, pp. 158\u2013162. ASA (1997)"},{"issue":"3","key":"9860_CR56","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1137\/S0363012993258586","volume":"34","author":"A. Trouv\u00e9","year":"1996","unstructured":"Trouv\u00e9 A.: Cycle decompositions and simulated annealing. SIAM J. Control Optim. 34(3), 966\u2013986 (1996)","journal-title":"SIAM J. Control Optim."},{"issue":"6","key":"9860_CR57","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/34.683775","volume":"20","author":"J.P. Wang","year":"1998","unstructured":"Wang J.P.: Stochastic relaxation on partitions with connected components and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 20(6), 619\u2013636 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"9860_CR58","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C. Ware","year":"2002","unstructured":"Ware C., Purchase H., Colpoys L., McGill M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103\u2013110 (2002)","journal-title":"Inf. Vis."},{"issue":"3","key":"9860_CR59","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1023\/A:1004697811243","volume":"104","author":"R. Yang","year":"2000","unstructured":"Yang R.: Convergence of the simulated annealing algorithm for continuous global optimization. J. Optim. Theory Appl. 104(3), 691\u2013716 (2000)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9860-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9860-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9860-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T07:30:04Z","timestamp":1561275004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9860-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,7]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9860"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9860-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,7]]}}}