{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T10:25:28Z","timestamp":1677752728832},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4131,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0925-7721(01)00051-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:02:47Z","timestamp":1027591367000},"page":"205-222","source":"Crossref","is-referenced-by-count":8,"title":["Densest translational lattice packing of non-convex polygons"],"prefix":"10.1016","volume":"22","author":[{"given":"Victor J.","family":"Milenkovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00051-7_BIB001","series-title":"Containment algorithms for nonconvex polygons with applications to layout, Ph.D. Thesis","author":"Daniels","year":"1995"},{"key":"10.1016\/S0925-7721(01)00051-7_BIB002","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/PL00014415","article-title":"Multiple translational containment, Part I: An approximate algorithm","volume":"19","author":"Daniels","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00051-7_BIB003","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/BF01190153","article-title":"Computing the intersection-depth of polyhedra","volume":"9","author":"Dobkin","year":"1993","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/S0925-7721(01)00051-7_BIB004","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","article-title":"Solution approaches to irregular nesting problems","volume":"84","author":"Dowsland","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB005","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","article-title":"Packing problems","volume":"56","author":"Dowsland","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB006","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB007","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02187800","article-title":"Double-lattice packings of convex bodies in the plane","volume":"5","author":"Kuperberg","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB008","series-title":"Compaction algorithms for nonconvex polygons and their applications, Ph.D. Thesis","author":"Li","year":"1994"},{"key":"10.1016\/S0925-7721(01)00051-7_BIB009","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0377-2217(95)00021-H","article-title":"Compaction and separation algorithms for nonconvex polygons and their applications","volume":"84","author":"Li","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB010","series-title":"Proc. 28th Annual ACM Symp. Theory Comput. (STOC-96)","first-page":"109","article-title":"Translational polygon containment and minimal enclosure using linear programming based restriction","author":"Milenkovic","year":"1996"},{"key":"10.1016\/S0925-7721(01)00051-7_BIB011","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1111\/j.1475-3995.1999.tb00171.x","article-title":"Translational polygon containment and minimal enclosure using mathematical programming","volume":"6","author":"Milenkovic","year":"1999","journal-title":"Internat. Trans. Oper. Res."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB012","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/PL00014416","article-title":"Multiple translational containment, Part II: Exact algorithms","volume":"19","author":"Milenkovic","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00051-7_BIB013","series-title":"The densest double-lattice packing of a convex polygon, Report 2584","author":"Mount","year":"1991"},{"issue":"7","key":"10.1016\/S0925-7721(01)00051-7_BIB014","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: A categorized, application-oriented research bibliography","volume":"43","author":"Sweeney","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0925-7721(01)00051-7_BIB015","first-page":"358","article-title":"Automated packing systems: Review of industrial implementations","volume":"2064","author":"Whelan","year":"1993"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:26:56Z","timestamp":1556465216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0925772101000517"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00051-7","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}