{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:32:59Z","timestamp":1725726779121},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385766"},{"type":"electronic","value":"9783642385773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38577-3_22","type":"book-chapter","created":{"date-parts":[[2013,5,19]],"date-time":"2013-05-19T21:31:53Z","timestamp":1368999113000},"page":"212-221","source":"Crossref","is-referenced-by-count":0,"title":["The Two-Dimensional Vector Packing Problem with Courier Cost Structure"],"prefix":"10.1007","author":[{"given":"Qian","family":"Hu","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Wenbin","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"22_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"G.J. Woeginger","year":"1997","unstructured":"Woeginger, G.J.: There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters\u00a064(6), 293\u2013297 (1997)","journal-title":"Information Processing Letters"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0167-6377(02)00173-6","volume":"31","author":"H. Kellerer","year":"2003","unstructured":"Kellerer, H., Kotov, V.: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Operations Research Letters\u00a031(1), 35\u201341 (2003)","journal-title":"Operations Research Letters"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"F.C.R. Spieksma","year":"1994","unstructured":"Spieksma, F.C.R.: A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & Operations Research\u00a021(1), 19\u201325 (1994)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A. Caprara","year":"2001","unstructured":"Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Applied Mathematics\u00a0111(3), 231\u2013262 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/opre.42.2.287","volume":"42","author":"S. Anily","year":"1994","unstructured":"Anily, S., Bramel, J., Simchi-Levi, D.: Worst-case analysis of heuristics for the bin packing problem with general cost structures. Operations Research\u00a042(2), 287\u2013298 (1994)","journal-title":"Operations Research"},{"issue":"1-2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-010-0403-5","volume":"132","author":"L. Epstein","year":"2012","unstructured":"Epstein, L., Levin, A.: Bin packing with general cost structures. Mathematical Programming\u00a0132(1-2), 355\u2013391 (2012)","journal-title":"Mathematical Programming"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ejor.2007.08.031","volume":"191","author":"J.Y.T. Leung","year":"2008","unstructured":"Leung, J.Y.T., Li, C.L.: An asymptotic approximation scheme for the concave cost bin packing problem. European Journal of Operational Research\u00a0191(2), 582\u2013586 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"22_CR8","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1016\/j.cor.2008.12.016","volume":"36","author":"M. Haouari","year":"2009","unstructured":"Haouari, M., Serairi, M.: Heuristics for the variable sized bin-packing problem. Computers & Operations Research\u00a036(10), 2877\u20132884 (2009)","journal-title":"Computers & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38577-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:17:07Z","timestamp":1557703027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38577-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385766","9783642385773"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38577-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}