{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T05:02:25Z","timestamp":1782363745712,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642366932","type":"print"},{"value":"9783642366949","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_27","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T10:08:39Z","timestamp":1362996519000},"page":"314-323","source":"Crossref","is-referenced-by-count":9,"title":["An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem"],"prefix":"10.1007","author":[{"given":"Tim","family":"Nonner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1287\/moor.1040.0109","volume":"30","author":"D. Adelman","year":"2005","unstructured":"Adelman, D., Klabjan, D.: Duality and existence of optimal policies in generalized joint replenishment. Mathematics of Operations Research\u00a030(1), 28\u201350 (2005)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1287\/opre.41.3.549","volume":"41","author":"A. Aggarwal","year":"1993","unstructured":"Aggarwal, A., Park, J.K.: Improved algorithms for economic lot size problems. Oper. Res.\u00a041(3), 549\u2013571 (1993)","journal-title":"Oper. Res."},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","volume":"8","author":"E. Arkin","year":"1989","unstructured":"Arkin, E., Joneja, D., Roundy, R.: Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters\u00a08(2), 61\u201366 (1989)","journal-title":"Operations Research Letters"},{"issue":"8","key":"27_CR4","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/mnsc.37.8.909","volume":"37","author":"A. Federgruen","year":"1991","unstructured":"Federgruen, A., Tzur, M.: A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or O(n) time. Management Science\u00a037(8), 909\u2013925 (1991)","journal-title":"Management Science"},{"key":"27_CR5","series-title":"Factory Management Series","volume-title":"Operations cost","author":"F.W. Harris","year":"1915","unstructured":"Harris, F.W.: Operations cost. Factory Management Series. A. W. Shaw Co., Chicago (1915)"},{"key":"27_CR6","first-page":"25","volume":"17","author":"P. Jackson","year":"1985","unstructured":"Jackson, P., Maxwell, W., Muckstadt, J.: The joint replenishment problem with power-of-two restriction. AIIE Trans.\u00a017, 25\u201332 (1985)","journal-title":"AIIE Trans."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/moor.1050.0178","volume":"31","author":"R. Levi","year":"2006","unstructured":"Levi, R., Roundy, R., Shmoys, D.B.: Primal-dual algorithms for deterministic inventory problems. Mathematics of Operations Research\u00a031, 267\u2013284 (2006)","journal-title":"Mathematics of Operations Research"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1287\/mnsc.1070.0781","volume":"54","author":"R. Levi","year":"2008","unstructured":"Levi, R., Roundy, R., Shmoys, D.B., Sviridenko, M.: A constant approximation algorithm for the one-warehouse multi-retailer problem. Management Science\u00a054, 763\u2013776 (2008)","journal-title":"Management Science"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Roundy, R., Muckstadt, J.: Handbooks in Operations Research and Management Science: Analysis in Multi-Stage Production Systems, pp. 59\u2013131. Elsevier (1993)","DOI":"10.1016\/S0927-0507(05)80182-3"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Naddor, E., Saltzman, S.: Optimal reorder periods for an inventory system with variable costs of ordering. Operations Research 6, 676\u2013685","DOI":"10.1287\/opre.6.5.676"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1142\/S1793830909000130","volume":"1","author":"T. Nonner","year":"2009","unstructured":"Nonner, T., Souza, A.: Approximating the joint replenishment problem with deadlines. Discrete Mathematics, Algorithms and Applications\u00a01(2), 153\u2013173 (2009)","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"issue":"11","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1287\/mnsc.31.11.1416","volume":"31","author":"R. Roundy","year":"1985","unstructured":"Roundy, R.: 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Science\u00a031(11), 1416\u20131430 (1985)","journal-title":"Management Science"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-642-23719-5_53","volume-title":"Algorithms \u2013 ESA 2011","author":"A.S. Schulz","year":"2011","unstructured":"Schulz, A.S., Telha, C.: Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 628\u2013639. Springer, Heidelberg (2011)"},{"key":"27_CR14","unstructured":"Segev, D.: An approximate dynamic-programming approach to the joint replenishment problem (2012) (manuscript)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Stauffer, G., Massonnet, G., Rapine, C., Gayon, J.-P.: A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 67\u201379 (2011)","DOI":"10.1137\/1.9781611973082.6"},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1287\/opre.49.4.599.11222","volume":"49","author":"C.-P. Teo","year":"2001","unstructured":"Teo, C.-P., Bertsimas, D.: Multistage lot sizing problems via randomized rounding. Operations Research\u00a049(4), 599\u2013608 (2001)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T17:41:25Z","timestamp":1557596485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}