{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:11Z","timestamp":1725488411200},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:51:29Z","timestamp":1186055489000},"page":"257-270","source":"Crossref","is-referenced-by-count":21,"title":["New Classes of Lower Bounds for Bin Packing 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":[[1998,6,18]]},"reference":[{"key":"20_CR1","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 Operations Research Society, 41:1069\u20131072, 1990. http:\/\/mscmga.ms.ic.ac.uk\/info.html","journal-title":"Journal of Operations Research Society"},{"key":"20_CR2","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E. G. Coffmann Jr.","year":"1997","unstructured":"E. G. Coffmann, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 46\u201393. PWS Publishing, Boston, 1997."},{"key":"20_CR3","volume-title":"Probabilistic Analysis of Packing and Partitioning Algorithms","author":"E. G. Coffmann Jr.","year":"1991","unstructured":"E. G. Coffmann, Jr. and G. S. Lueker. Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York, 1991."},{"key":"20_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-63397-9_12","volume-title":"Algorithms \u2014 ESA\u2019 97","author":"S. P. Fekete","year":"1997","unstructured":"S. P. Fekete and J. Schepers. A new exact algorithm for general orthogonal d-dimensional knapsack problems. Algorithms \u2014 ESA\u2019 97, LNCS, Vol. 1284, pages 144\u2013156. Springer, 1997."},{"key":"20_CR5","unstructured":"S. P. Fekete and J. Schepers. On more-dimensional packing I: Modeling. ZPR Technical Report 97-288. http:\/\/www.zpr.uni-koeln.de"},{"key":"20_CR6","unstructured":"S. P. Fekete and J. Schepers. On more-dimensional packing II: Bounds. ZPR Technical Report 97-289. http:\/\/www.zpr.uni-koeln.de"},{"key":"20_CR7","unstructured":"S. P. Fekete and J. Schepers. On more-dimensional packing III: Exact Algorithms. ZPR Technical Report 97-290. http:\/\/www.zpr.uni-koeln.de"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+\u03b5 in linear time. Combinatorica, 1:349\u2013355, 1981.","journal-title":"Combinatorica"},{"key":"20_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979."},{"key":"20_CR10","unstructured":"I. P. Gent. Heuristic solution of open bin packing problems. (To appear in Journal of Heuristics). http:\/\/www.cs.strath.ac.uk\/~apes\/papers"},{"key":"20_CR11","volume-title":"Near-optimal bin packing algorithms","author":"D. S. Johnson","year":"1973","unstructured":"D. S. Johnson. Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"N. Karmarkar and R. M. Karp. An efficient approximation scheme for the onedimensional bin packing problem. Proc. 23rd Annual Symp. Found. Comp. Sci. (FOCS 1982), pages 312\u2013320, 1982.","DOI":"10.1109\/SFCS.1982.61"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"G. S. Lueker. Bin packing with items uniformly distributed over intervals [a,b]. Proc. 24th Annual Symp. Found. Comp. Sci. (FOCS 1983), pages 289\u2013297, 1983.","DOI":"10.1109\/SFCS.1983.9"},{"key":"20_CR14","unstructured":"S. Martello, D. Pisinger, and D. Vigo. The three-dimensional bin packing problem. Technical Report DEIS-OR-97-6, 1997. http:\/\/www.deis.unibo.it"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28:59\u201370, 1990.","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR16","volume-title":"Knapsack Problems","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth. Knapsack Problems. Wiley, New York, 1990."},{"key":"20_CR17","unstructured":"S. Martello and D. Vigo. Exact solution of the two-dimensional finite bin packing problem. Technical Report DEIS-OR-96-3, 1996. http:\/\/www.deis.unibo.it"},{"key":"20_CR18","unstructured":"J. Schepers. Exakte Algorithmen f\u00fcr Orthogonale Packungsprobleme. PhD thesis, Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, 1997."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:06:03Z","timestamp":1556719563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}