{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:23:10Z","timestamp":1759666990709},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633976"},{"type":"electronic","value":"9783540695363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63397-9_12","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"144-156","source":"Crossref","is-referenced-by-count":37,"title":["A new exact algorithm for general orthogonal d-dimensional knapsack problems"],"prefix":"10.1007","author":[{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Schepers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/0377-2217(95)00026-M","volume":"84","author":"M. Arenales","year":"1995","unstructured":"M. Arenales and R. Morabito. An AND\/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. European Journal of Operations Research, 84, 1995, pp. 599\u2013617.","journal-title":"European Journal of Operations Research"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J. E. Beasley","year":"1985","unstructured":"J. E. Beasley. An exact two-dimensional non-guillotine cutting stock tree search procedure. Operations Research, 33, 1985, pp. 49\u201364.","journal-title":"Operations Research"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"J. E. Beasley. OR-Library: distributing test problems by electronic mail. Journal of the Operations Research Society, 41, 1990, pp. 1069\u20131072.","journal-title":"Journal of the Operations Research Society"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(84)90075-4","volume":"16","author":"M. Bird","year":"1984","unstructured":"M. Bird and E. Boros. Network flows and non-guillotine cutting patterns. European Journal of Operations Research, 16, 1984, pp. 215\u2013221.","journal-title":"European Journal of Operations Research"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1977","unstructured":"N. Christofides and C. Whitlock. An algorithm for two-dimensional cutting problems. Operations Research, 25, 1977, pp. 31\u201344.","journal-title":"Operations Research"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0377-2217(87)90140-8","volume":"31","author":"K. A. Dowsland","year":"1987","unstructured":"K. A. Dowsland. An exact algorithm for the pallet loading problem. European Journal of Operations Research, 31, 1987, pp. 78\u201384.","journal-title":"European Journal of Operations Research"},{"key":"12_CR7","unstructured":"S. P. Fekete and H. Meijer. Rectangle and box visibility graphs in 3D. To appear in International Journal of Computational Geometry and its Applications. Available at ftp:\/\/ftp.zpr.uni-koeln.de\/pub\/paper\/zpr96-224.ps.gz."},{"key":"12_CR8","unstructured":"S. P. Fekete and J. Schepers. A new classs of lower bounds for bin packing problems. ZPR Report 97-265. Available at ftp:\/\/ftp.zpr.uni-koeln.de\/pub\/ paper\/zpr97-265.ps.gz."},{"key":"12_CR9","unstructured":"S. P. Fekete, J. Schepers, and M. Wottawa. PACKLIB: a library of packing problems. Under construction."},{"key":"12_CR10","first-page":"25","volume":"42","author":"G. Galambos","year":"1995","unstructured":"G. Galambos and G. J. Woeginger. On-line bin packing-a restricted survey. Zeitschrift f\u00fcr Operations Research, 42, 1995, pp. 25\u201345.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"12_CR11","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980."},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E. Hadjiconstantinou","year":"1995","unstructured":"E. Hadjiconstantinou and N. Christofides. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operations Research, 83, 1995, pp. 39\u201356.","journal-title":"European Journal of Operations Research"},{"key":"12_CR13","unstructured":"M. R. Jerrum. A data structure for systems of orthogonal, non-overlapping rectangles. Internal Report CSR-239-87, Department of Computer Science, Edinburgh University, August 1987."},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"N. Korte and R. H. M\u00f6hring. An incremental linear-time algorithm for recognizing interval graphs. Siam Journal of Computing, 18, 1989, pp. 68\u201381.","journal-title":"Siam Journal of Computing"},{"key":"12_CR15","volume-title":"Knapsack Problems-Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth. Knapsack Problems-Algorithms and Computer Implementations, Wiley, Chichester, 1990."},{"key":"12_CR16","unstructured":"J. Schepers. Exakte Algorithmen f\u00fcr orthogonale Packungsprobleme. Doctoral thesis, Universit\u00e4t zu K\u00f6ln, in preparation for 1997."},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"P. Y. Wang","year":"1983","unstructured":"P. Y. Wang. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31, 1983, pp. 573\u2013586.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63397-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T17:31:07Z","timestamp":1549215067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63397-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633976","9783540695363"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-63397-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}