{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:33Z","timestamp":1725496773168},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402053"},{"type":"electronic","value":"9783540448679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44867-5_5","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T06:34:45Z","timestamp":1196404485000},"page":"59-69","source":"Crossref","is-referenced-by-count":4,"title":["An On-Line Algorithm for the Rectangle Packing Problem with Rejection"],"prefix":"10.1007","author":[{"given":"Massimiliano","family":"Caramia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Giordan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Iovanella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J. E. Beasley","year":"1985","unstructured":"Beasley, J. E.: An exact two-dimensional non-guillotine cutting tree search procedures. Operation Research 33 (1985) 49\u201364","journal-title":"Operation Research"},{"key":"5_CR2","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)"},{"key":"5_CR3","unstructured":"Blitz, D. Van Vliet, A., Woeginger, G. J.: Lower bounds on the asymptotic worst case ratio of the on-line bin packing problem. Unpublished manuscript (1996)"},{"key":"5_CR4","unstructured":"Confessore, G., Dell\u2019Olmo, P., Giordani, S.: Complexity and approximation results for scheduling multiprocessor tasks on a ring. Discrete Applied Mathematics, (to appear)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","volume":"13","author":"J. Csirik","year":"1993","unstructured":"Csirik, J., Van Vliet, A.: An on-line algorithm for multidimensional bin packing. Operations Research Letters 13 (1993) 149\u2013158","journal-title":"Operations Research Letters"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"Drozdowski, M.: Scheduling multiprocessor task. An overview. European Journal of Operations Research 94 (1996) 215\u2013230","journal-title":"European Journal of Operations Research"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Online Algorithms: The State of the Art","year":"1998","unstructured":"Fiat, A. (ed.), Woeginger, G. J. (ed): Online Algorithms: The State of the Art. Lecture Notes in Computer Science, Vol. 1442. Springer-Verlag, Berlin Heidelberg (1998)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"R. W. Haessler","year":"1991","unstructured":"Haessler, R. W., Sweeney, P. E.: Cutting stock problems and solution procedures. European Journal of Operational Research 54 (1991) 141\u2013150","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. S. Hochbaum","year":"1985","unstructured":"Hochbaum, D. S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the Association for Computing Machinery 32(1) (1985) 130\u2013136","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., Turton, B. C. H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 1281 (2001) 34\u201357","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., Turton, B. C. H.: A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems. Artificial Intelligence Review 164 (2001) 257\u2013300","journal-title":"Artificial Intelligence Review"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. C. Lee","year":"1985","unstructured":"Lee, C. C., Lee, D. T.: A simple on-line bin packing algorithm, Journal of ACM 32 (1985) 562\u2013572","journal-title":"Journal of ACM"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","volume":"10","author":"J. Leung","year":"1990","unstructured":"Leung, J., Tam, T., Wong, C. S., Young, G., Chin, F.: Packing squares into square. Journal of Parallel and Distributed Computing 10 (1990) 271\u2013275","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 379\u2013396","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research 141 (2002) 241\u2013252","journal-title":"European Journal of Operational Research"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6377(01)00081-5","volume":"29","author":"C. Imreh","year":"2001","unstructured":"Imreh, C.: Online strip packing with modifiable boxes. Operation Research Letters 29 (2001), 79\u201385","journal-title":"Operation Research Letters"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. Shmoys","year":"1995","unstructured":"Shmoys, D., Wien, J., Williamson, D. P.: Scheduling parallel machines on-line. SIAM Journal of Computing 24 (1995) 1313\u20131331","journal-title":"SIAM Journal of Computing"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"141","author":"Y. L. Wu","year":"2002","unstructured":"Wu, Y. L., Huang, W., Lau, S. C., Wong, C. K., Young, G. H.: An effective quasi-human based heuristic for solving the rectangle packing problem. European Journal of Operational Research 141 (2002) 341\u2013358","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44867-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:26:20Z","timestamp":1551140780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44867-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402053","9783540448679"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44867-5_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}