乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T02:29:04Z","timestamp":1674959344274},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":2421,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1016\/j.disopt.2006.06.001","type":"journal-article","created":{"date-parts":[[2006,8,22]],"date-time":"2006-08-22T12:06:00Z","timestamp":1156248360000},"page":"317-326","source":"Crossref","is-referenced-by-count":5,"title":["Packing into the smallest square: Worst-case analysis of lower bounds"],"prefix":"10.1016","volume":"3","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2006.06.001_b1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/moor.1050.0168","article-title":"Bin packing in multiple dimensions: Inapproximability results and approximation schemes","volume":"31","author":"Bansal","year":"2006","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.disopt.2006.06.001_b2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","article-title":"Algorithms for unconstrained two-dimensional guillotine cutting","volume":"36","author":"Beasley","year":"1985","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.disopt.2006.06.001_b3","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"},{"key":"10.1016\/j.disopt.2006.06.001_b4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","article-title":"Packing rectangular pieces\u2014a heuristic approach","volume":"25","author":"Bengtsson","year":"1982","journal-title":"The Computer Journal"},{"key":"10.1016\/j.disopt.2006.06.001_b5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.orl.2005.02.005","article-title":"Resource augmentation in two-dimensional packing with orthogonal rotations","volume":"34","author":"Correa","year":"2006","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.disopt.2006.06.001_b6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0166-218X(01)00253-0","article-title":"A lower bound for the non-oriented two-dimensional bin packing problem","volume":"118","author":"Dell\u2019Amico","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.disopt.2006.06.001_b7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1038\/scientificamerican1079-18","article-title":"Some packing problems that cannot be solved by sitting on the suitcase","volume":"241","author":"Gardner","year":"1979","journal-title":"Scientific American"},{"key":"10.1016\/j.disopt.2006.06.001_b8","series-title":"Packing and Covering in Combinatorics","first-page":"129","article-title":"Geometrical packing and covering problems","author":"G\u00f6bel","year":"1979"},{"key":"10.1016\/j.disopt.2006.06.001_b9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0278-6","article-title":"An exact algorithm for the orthogonal, 2-D cutting problems using guillotine cuts","volume":"83","author":"Hadjiconstantinou","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.disopt.2006.06.001_b10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","article-title":"An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem","volume":"128","author":"Hopper","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.disopt.2006.06.001_b11","unstructured":"R. Korf, Optimal rectangle packing: Initial results, in: Proceedings of the International Conference on Automated Planning and Scheduling, ICAPS-03, 2003, pp. 287\u2013295"},{"key":"10.1016\/j.disopt.2006.06.001_b12","unstructured":"R. Korf, Optimal rectangle packing: New results, in: Proceedings of the International Conference on Automated Planning and Scheduling, ICAPS-04, 2004, pp. 142\u2013149"},{"key":"10.1016\/j.disopt.2006.06.001_b13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","article-title":"Packing squares into a square","volume":"10","author":"Leung","year":"1990","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/j.disopt.2006.06.001_b14","unstructured":"K. Li, K.H. Cheng, Complexity of resource allocation and job scheduling problems in partitionable mesh connected systems, in: Proceedings of the 1st IEEE Symposium on Parallel and Distributed Processing, 1989, pp. 358\u2013365"},{"key":"10.1016\/j.disopt.2006.06.001_b15","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","article-title":"Exact solution of the two-dimensional finite bin packing problem","volume":"44","author":"Martello","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/j.disopt.2006.06.001_b16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4064\/cm-17-1-103-110","article-title":"Some packing and covering theorems","volume":"17","author":"Moon","year":"1967","journal-title":"Colloquium Mathematicum"},{"key":"10.1016\/j.disopt.2006.06.001_b17","series-title":"On Packing of Squares into a Rectangle","author":"Novotny","year":"1996"},{"key":"10.1016\/j.disopt.2006.06.001_b18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(95)00184-0","article-title":"Worst-case analysis of fast heuristics for packing squares into a square","volume":"164","author":"Picouleau","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.disopt.2006.06.001_b19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","article-title":"A strip-packing algorithm with absolute performance bound 2","volume":"26","author":"Steinberg","year":"1997","journal-title":"SIAM Journal on Computing"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528606000491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528606000491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T19:35:20Z","timestamp":1555788920000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528606000491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["S1572528606000491"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2006.06.001","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}