{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:28:20Z","timestamp":1750177700997},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_56","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"601-611","source":"Crossref","is-referenced-by-count":1,"title":["The Train Delivery Problem Revisited"],"prefix":"10.1007","author":[{"given":"Jing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms. PWS Publishing Company (1997)"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1 + \u03b5 in linear time. Combinatorica (1981)","DOI":"10.1007\/BF02579456"},{"key":"56_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-18318-8_9","volume-title":"Approximation and Online Algorithms","author":"A. Das","year":"2011","unstructured":"Das, A., Mathieu, C., Mozes, S.: The Train Delivery Problem - Vehicle Routing Meets Bin Packing. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol.\u00a06534, pp. 94\u2013105. Springer, Heidelberg (2011)"},{"issue":"1","key":"56_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F.D. Murgolo","year":"1987","unstructured":"Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput.\u00a016(1), 149\u2013161 (1987)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"56_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cstrong\u201d np-completeness results: Motivation, examples, and implications. J. ACM\u00a025(3), 499\u2013508 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"56_CR6","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput.\u00a015(1), 222\u2013230 (1986)","journal-title":"SIAM J. Comput."},{"key":"56_CR7","first-page":"312","volume-title":"FOCS","author":"N. Karmarkar","year":"1982","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: FOCS, pp. 312\u2013320. IEEE Computer Society, Washington, DC (1982)"},{"issue":"2","key":"56_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00247-3","volume":"147","author":"J. Kang","year":"2003","unstructured":"Kang, J., Park, S.: Algorithm for the variable sized bin packing problem. European Journal of Operational Research\u00a0147(2), 365\u2013372 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"56_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/S0097539702412908","volume":"32","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R., Epstein, L.: New bounds for variable-sized online bin packing. SIAM Journal on Computing\u00a032(2), 455\u2013469 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"56_CR10","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/060670328","volume":"38","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput.\u00a038(1), 411\u2013428 (2008)","journal-title":"SIAM J. Comput."},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processor: Using the dual approximation approach. SIAM Journal on Computing\u00a017, 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR12","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G., Stougie, L.: Analysis of heuristics for vehicle routing problems. In: Vehicle Routing: Methods and Studies. Management Sci. System, vol.\u00a016, pp. 47\u201361. North Holland, Amsterdam, Elsevier Scinece B.V. This is a full in book entry (1988)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:39:31Z","timestamp":1558780771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}