{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T12:55:24Z","timestamp":1773406524153,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00527-1","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:52:50Z","timestamp":1043941970000},"page":"533-539","source":"Crossref","is-referenced-by-count":1,"title":["Complexity and approximability results for slicing floorplan designs"],"prefix":"10.1016","volume":"149","author":[{"given":"Vladimir G.","family":"De\u0131\u0306neko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00527-1_BIB1","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/S0377-2217(97)00085-4","article-title":"Optimal cutting directions and rectangle orientation algorithm","volume":"109","author":"Almeida","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB4","first-page":"21","article-title":"A min-cut placement algorithm for general cell assemblies based on a graph representation","volume":"4","author":"Lauther","year":"1980","journal-title":"Journal of Digital Systems"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB5","series-title":"Proceedings of the 19th ACM IEEE Design and Automation Conference","first-page":"261","article-title":"Automatic floorplan design","author":"Otten","year":"1982"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB6","series-title":"Proceedings of the International Symposium on Physical Design (ISPD\u201900)","first-page":"201","article-title":"What is a floorplan?","author":"Otten","year":"2000"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","article-title":"Optimal orientations of cells in slicing floorplan designs","volume":"57","author":"Stockmeyer","year":"1983","journal-title":"Information and Control"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB8","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/43.149770","article-title":"Optimal floorplan area optimization","volume":"11","author":"Wang","year":"1992","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0377-2217(02)00527-1_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","article-title":"When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?","volume":"12","author":"Woeginger","year":"2000","journal-title":"INFORMS Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702005271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702005271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:57:22Z","timestamp":1553929042000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702005271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702005271"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00527-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}