{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:52:44Z","timestamp":1772794364707,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0377-2217(02)00129-7","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:46:28Z","timestamp":1034279188000},"page":"341-358","source":"Crossref","is-referenced-by-count":100,"title":["An effective quasi-human based heuristic for solving the rectangle packing problem"],"prefix":"10.1016","volume":"141","author":[{"given":"Yu-Liang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Wenqi","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Siu-chung","family":"Lau","sequence":"additional","affiliation":[]},{"given":"C.K","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Gilbert H","family":"Young","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00129-7_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","article-title":"An exact two-dimensional non-guillotine cutting tree search procedure","volume":"33","author":"Beasley","year":"1985","journal-title":"Operations Research"},{"issue":"9","key":"10.1016\/S0377-2217(02)00129-7_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Communication of ACM"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","article-title":"An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts","volume":"83","author":"Christofides","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1018517106992","article-title":"New approaches to nesting rectangular patterns","volume":"8","author":"Dagli","year":"1997","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"34","key":"10.1016\/S0377-2217(02)00129-7_BIB5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1080\/01966324.1988.10737243","article-title":"Practical automatic placement for standard-cell integrated circuit","volume":"8","author":"Diegert","year":"1988","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB6","series-title":"Proceedings of IEEE ASPDAC'01, Yokohama, January","first-page":"601","article-title":"VLSI block placement using Less Flexibility First principles","author":"Dong","year":"2001"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB7","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB8","unstructured":"E. Hadjiconstantinou, N. Christofides, An optimal algorithm for general orthogonal 2-D cutting problems, Technical report MS-91\/2, Imperial College, London, UK"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","article-title":"Cutting stock problems and solution procedures","volume":"54","author":"Haessler","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB10","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","article-title":"An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock","volume":"24","author":"Higi","year":"1997","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00129-7_BIB11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","article-title":"Approximation schemes for covering and packing problems in image processing and VLSI","volume":"32","author":"Hochbaum","year":"1985","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"10.1016\/S0377-2217(02)00129-7_BIB12","first-page":"176","article-title":"A quasi-physical method for solving packing problems","volume":"2","author":"Huang","year":"1979","journal-title":"Acta Mathematicae Applagatae Sinica"},{"issue":"8","key":"10.1016\/S0377-2217(02)00129-7_BIB13","first-page":"610","article-title":"A quasi-physical method for solving the covering problem \u2013 an approach to tackling NP-hard problems","volume":"12","author":"Huang","year":"1989","journal-title":"Chinese Journal of Computer"},{"issue":"4","key":"10.1016\/S0377-2217(02)00129-7_BIB14","first-page":"443","article-title":"A quasi-physical method for solving the three dimensional packing problem","volume":"9","author":"Huang","year":"1986","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB15","series-title":"Proc. International Workshop on Discrete Mathematics and Algorithms","article-title":"Quasi-physical and quasi-social methods for tackling NP-hard problems","author":"Huang","year":"1994"},{"issue":"2","key":"10.1016\/S0377-2217(02)00129-7_BIB16","first-page":"179","article-title":"The quasi-physical and quasi-sociological algorithm solar for solving SAT problem","volume":"27","author":"Huang","year":"1997","journal-title":"Science in China"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","article-title":"On genetic algorithms for the packing of polygons","volume":"88","author":"Jakobs","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","article-title":"Packing squares into square","volume":"10","author":"Leung","year":"1990","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"10.1016\/S0377-2217(02)00129-7_BIB20","first-page":"116","article-title":"A mathematic-physical approach to the satisfiability problem","volume":"38","author":"Li","year":"1995","journal-title":"Science in China (Series A)"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB21","series-title":"Proceedings of the First Annual IEEE Symposium of Parallel and Distributed Processing","first-page":"358","article-title":"Complexity of resource allocation and job scheduling problems in partitionable mesh connected systems","author":"Li","year":"1989"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB22","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","article-title":"An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles","volume":"112","author":"Liu","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(02)00129-7_BIB23","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/43.673633","article-title":"VLSI\/PCB placement with obstacles based on sequence pair","volume":"17","author":"Murata","year":"1998","journal-title":"IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB24","series-title":"The Annealing Algorithm","author":"Otten","year":"1989"},{"issue":"1","key":"10.1016\/S0377-2217(02)00129-7_BIB25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/TCAD.1985.1270098","article-title":"Geographical data structures compared: A study of data structures supporting region queries","volume":"CAD-4","author":"Rosenberg","year":"1985","journal-title":"IEEE Transaction on Computer-aided Design"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB26","series-title":"Proceedings of IEEE APCCAS: Microelectronic and Integration System, Thailand","first-page":"137","article-title":"An effective quasi-human based heuristic for solving rectangle packing problems","author":"Tam","year":"1998"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0360-8352(89)90013-2","article-title":"A computational improvement to Wang's two-dimensional cutting stock problem","volume":"16","author":"Vasko","year":"1989","journal-title":"Computer and Industrial Engineering"},{"key":"10.1016\/S0377-2217(02)00129-7_BIB28","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.41.4.768","article-title":"Best-first search methods for constrained two-dimensional cutting stock problems","volume":"41","author":"Viswanathan","year":"1993","journal-title":"Operation Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00129-7_BIB29","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.31.3.573","article-title":"Two algorithms for constrained two-dimensional cutting stock problems","volume":"31","author":"Wang","year":"1983","journal-title":"Operation Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:26:13Z","timestamp":1556717173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702001297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0377221702001297"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00129-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}