{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:56Z","timestamp":1725482216180},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_3","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"27-28","source":"Crossref","is-referenced-by-count":0,"title":["Discrete Optimization Methods for Packing Problems in Two and Three Dimensions \u2014 With Applications in the Textile and Car Manufacturing Industries"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Lengauer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02099695","volume":"57","author":"J. Heistermann","year":"1995","unstructured":"J. Heistermann, T. Lengauer. The Nesting Problem in the Leather Manufacturing Industry. Annals of Operations Research 57 (1995) 147\u2013173","journal-title":"Annals of Operations Research"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0377-2217(97)00049-0","volume":"108","author":"R. Heckmann","year":"1998","unstructured":"R. Heckmann, T. Lengauer. Computing Upper and Lower Bounds on Textile Nesting Problems. European Journal of Operational Research 108,3 (1998) 473\u2013489","journal-title":"European Journal of Operational Research"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"V. Milenkovic. Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. Proc. 28th Annual ACM Symposium on Theory of Computing (1996) 109\u2013118","DOI":"10.1145\/237814.237840"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"V. Milenkovic. Rotational Polygon OverlapMinimization. Thirteenth Annual ACM Symposium on Computational Geometry (1997) 334\u2013343","DOI":"10.1145\/262839.262996"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T03:45:48Z","timestamp":1550288748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}