{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:33Z","timestamp":1725565053715},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_26","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T17:18:16Z","timestamp":1283966296000},"page":"206-214","source":"Crossref","is-referenced-by-count":6,"title":["A Simulated Annealing Algorithm for the Circles Packing Problem"],"prefix":"10.1007","author":[{"given":"Defu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"32","key":"26_CR2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"1","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the Association for Computing Machinery\u00a01(32), 130\u2013136 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"R.W. Haessler","year":"1991","unstructured":"Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. European Journal of Operational Research\u00a054(1), 141\u2013150 (1991)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K.A. Dowsland","year":"1992","unstructured":"Dowsland, K.A., Dowsland, W.B.: Packing problems. European Journal of Operational Research\u00a056(1), 2\u201314 (1992)","journal-title":"European Journal of Operational Research"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/BFb0056929","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"G.R. Raidl","year":"1998","unstructured":"Raidl, G.R., Kodydek, G.: Genetic Algorithms for the Multiple Container Packing Problem. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 875\u2013884. Springer, Heidelberg (1998)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Lubachevsky, D., Graham, R.L.: Curved hexagonal packing of equal disks in a circle. Discrete & Computational Geometry, 179\u2013194 (1997)","DOI":"10.1007\/PL00009314"},{"issue":"2","key":"26_CR7","first-page":"176","volume":"2","author":"H. Wenqi","year":"1979","unstructured":"Wenqi, H., Shuhao, Z.: A quasi-physical method for solving packing problems. Acta Mathematicae Applagatae Sinica\u00a02(2), 176\u2013180 (1979)","journal-title":"Acta Mathematicae Applagatae Sinica"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/S0377-2217(01)00241-7","volume":"141","author":"H. Wang","year":"2002","unstructured":"Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research\u00a0141, 440\u2013453 (2002)","journal-title":"European Journal of Operational Research"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/0377-2217(95)00032-L","volume":"84","author":"J.A. George","year":"1995","unstructured":"George, J.A., George, J.M., Lammar, B.W.: Packing different-sized circles into a rectangular container. European Journal of Operational Research\u00a084, 693\u2013712 (1995)","journal-title":"European Journal of Operational Research"},{"key":"26_CR10","doi-asserted-by":"publisher","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\u00a0220, 671\u2013689 (1983)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:51:51Z","timestamp":1558288311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}