{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T09:54:29Z","timestamp":1694166869803},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2010,11,26]],"date-time":"2010-11-26T00:00:00Z","timestamp":1290729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s11432-010-4112-8","type":"journal-article","created":{"date-parts":[[2010,11,25]],"date-time":"2010-11-25T16:02:04Z","timestamp":1290700924000},"page":"2389-2398","source":"Crossref","is-referenced-by-count":3,"title":["A quasi-human algorithm for solving the three-dimensional rectangular packing problem"],"prefix":"10.1007","volume":"53","author":[{"given":"Kun","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WenQi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,26]]},"reference":[{"key":"4112_CR1","first-page":"151","volume-title":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC)","author":"S. A. Cook","year":"1971","unstructured":"Cook S A. The complexity of theorem-proving procedures. In: Harrison M A, Banerji R B, Ullman J D, eds. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC). New York: ACM Press, 1971. 151\u2013158"},{"key":"4112_CR2","unstructured":"Cook S A. The P vs. NP Problem. CLAY Mathematics Foundation Millennium Problems, http:\/\/www.claymath.org\/millennium"},{"key":"4112_CR3","first-page":"665","volume-title":"International Congress of Mathematicians (ICM)","author":"A. Wigderson","year":"2007","unstructured":"Wigderson A. P, NP and mathematics: a computational complexity perspective. In: International Congress of Mathematicians (ICM). Zurich: EMS Publishing House, 2007. 1: 665\u2013712"},{"key":"4112_CR4","first-page":"176","volume":"2","author":"W. Q. Huang","year":"1979","unstructured":"Huang W Q, Zhan S H. A quasi-physical method for solving packing problems (in Chinese). J Appl Math, 1979, 2: 176\u2013180","journal-title":"J Appl Math"},{"key":"4112_CR5","first-page":"47","volume-title":"Introduction to the Modern Theory of Computation D Background, Foreground and Solving Method for the NP-hard Problem (in Chinese)","author":"W. Q. Huang","year":"2004","unstructured":"Huang W Q, Xu R C. Introduction to the Modern Theory of Computation D Background, Foreground and Solving Method for the NP-hard Problem (in Chinese). Beijing: Science Press, 2004. 47\u201370"},{"key":"4112_CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/s11432-009-0005-0","volume":"52","author":"W. Q. Huang","year":"2009","unstructured":"Huang W Q, He K. A pure quasi-human algorithm for solving the cuboid packing problem. Sci China Ser F-Inf Sci, 2009, 52: 52\u201358","journal-title":"Sci China Ser F-Inf Sci"},{"key":"4112_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2008.02.024","volume":"196","author":"W. Q. Huang","year":"2009","unstructured":"Huang W Q, He K. A caving degree approach for the single container loading problem. Eur J Oper Res, 2009, 196: 93\u2013101","journal-title":"Eur J Oper Res"},{"key":"4112_CR8","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.ejor.2004.04.037","volume":"168","author":"E. E. Bischoff","year":"2006","unstructured":"Bischoff E E. Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res, 2006, 168: 952\u2013966","journal-title":"Eur J Oper Res"},{"key":"4112_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","volume":"20","author":"A. Moura","year":"2005","unstructured":"Moura A, Oliveira J F. A GRASP approach to the container-loading problem. IEEE Intell Syst, 2005, 20: 50\u201357","journal-title":"IEEE Intell Syst"},{"key":"4112_CR10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1111\/1475-3995.00369","volume":"9","author":"H. Gehring","year":"2002","unstructured":"Gehring H, Bortfeldt A. A parallel genetic algorithm for solving the container loading problem. Int Trans Oper Res, 2002, 9: 497\u2013511","journal-title":"Int Trans Oper Res"},{"key":"4112_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A. Bortfeldt","year":"2001","unstructured":"Bortfeldt A, Gehring H. A hybrid genetic algorithm for the container loading problem. Eur J Oper Res, 2001, 131: 143\u2013161","journal-title":"Eur J Oper Res"},{"key":"4112_CR12","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","volume":"29","author":"A. Bortfeldt","year":"2003","unstructured":"Bortfeldt A, Gehring H, Mack D. A parallel tabu search algorithm for solving the container loading problem. Parall Comput, 2003, 29: 641\u2013662","journal-title":"Parall Comput"},{"key":"4112_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-008-9081-3","volume":"16","author":"F. Parreno","year":"2010","unstructured":"Parreno F, Alvarez-Valdes R, Oliveira J F, et al. Neighborhood structures for the container loading problem: a VNS implementation. J Heurist, 2010, 16: 1\u201322","journal-title":"J Heurist"},{"key":"4112_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"E. E. Bischoff","year":"1995","unstructured":"Bischoff E E, Ratcliff M S W. Issues in the development of approaches to container loading. OMEGA-Int J Manag S, 1995, 23: 377\u2013390","journal-title":"OMEGA-Int J Manag S"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4112-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4112-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4112-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:08Z","timestamp":1559403368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4112-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,26]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["4112"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4112-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,26]]}}}