{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:40Z","timestamp":1725560200276},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_56","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:24:30Z","timestamp":1279826670000},"page":"618-629","source":"Crossref","is-referenced-by-count":4,"title":["Packing a Trunk"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Funke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Reichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Sch\u00f6mer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1979)"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.F. Fowler","year":"1981","unstructured":"Fowler, R.F., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters\u00a012, 133\u2013137 (1981)","journal-title":"Information Processing Letters"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(99)00006-1","volume":"13","author":"V.J. Milenkovic","year":"1999","unstructured":"Milenkovic, V.J.: Rotational polygon containment and minimum enclosure using only robust 2d constructions. Computational Geometry\u00a013, 3\u201319 (1999)","journal-title":"Computational Geometry"},{"key":"56_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BFb0014488","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"K. Daniels","year":"1996","unstructured":"Daniels, K., Milenkovic, V.J.: Column-based strip packing using ordered and compliant containment. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 33\u201338. Springer, Heidelberg (1996)"},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/S0010-4485(01)00109-9","volume":"34","author":"J. Cagan","year":"2002","unstructured":"Cagan, J., Shimada, K., Yin, S.: A survey of computational approaches to threedimensional layout problems. Computer-Aided Design\u00a034, 597\u2013611 (2002)","journal-title":"Computer-Aided Design"},{"key":"56_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-48481-7_37","volume-title":"Algorithms - ESA\u201999","author":"B. Verweij","year":"1999","unstructured":"Verweij, B., Aardal, K.: An optimisation algorithm for maximum independent set with applications in map labelling. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 426\u2013437. Springer, Heidelberg (1999)"},{"key":"56_CR7","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02. Springer, Heidelberg (1988)"},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Mathematical Programming\u00a05, 199\u2013215 (1973)","journal-title":"Mathematical Programming"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. Journal of Combinatorial Theory Ser. B\u00a018, 138\u2013154 (1975)","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L. Wolsey","year":"1975","unstructured":"Wolsey, L.: Faces for a linear inequality in 0-1 variables. Mathematical Programming\u00a08, 165\u2013178 (1975)","journal-title":"Mathematical Programming"},{"key":"56_CR12","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0927-0507(89)01007-8","volume-title":"Optimization","author":"G.L. Nemhauser","year":"1989","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer programming. In: Nemhauser, G.L., et al. (eds.) Optimization. Handbooks in Operations Research and Management Science, vol.\u00a01, pp. 447\u2013527. Elsevier, Amsterdam (1989)"},{"key":"56_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"A.M.H. Gerards","year":"1986","unstructured":"Gerards, A.M.H., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica\u00a06, 365\u2013379 (1986)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T03:04:59Z","timestamp":1552791899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}