{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:36:11Z","timestamp":1777718171789,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T00:00:00Z","timestamp":1435881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T00:00:00Z","timestamp":1435881600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0832782"],"award-info":[{"award-number":["CCF-0832782"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1017688"],"award-info":[{"award-number":["CCF-1017688"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["PGS-358528"],"award-info":[{"award-number":["PGS-358528"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["NDSEG"],"award-info":[{"award-number":["NDSEG"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-0846554"],"award-info":[{"award-number":["CMMI-0846554"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-11-1-0150"],"award-info":[{"award-number":["FA9550-11-1-0150"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SMA"},{"name":"Buschbaum Research Fund of MIT"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0832782"],"award-info":[{"award-number":["CCF-0832782"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1017688"],"award-info":[{"award-number":["CCF-1017688"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0920-3","type":"journal-article","created":{"date-parts":[[2015,7,2]],"date-time":"2015-07-02T14:40:32Z","timestamp":1435848032000},"page":"207-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["The submodular joint replenishment problem"],"prefix":"10.1007","volume":"158","author":[{"given":"Maurice","family":"Cheung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam N.","family":"Elmachtoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Retsef","family":"Levi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,3]]},"reference":[{"issue":"2","key":"920_CR1","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. Oper. Res. Lett. 8(2), 61\u201366 (1989)","journal-title":"Oper. Res. Lett."},{"key":"920_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_11","volume-title":"Latency Constrained Aggregation in Sensor Networks","author":"L Becchetti","year":"2006","unstructured":"Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., Vitaletti, A.: Latency Constrained Aggregation in Sensor Networks. Springer, Berlin (2006)"},{"key":"920_CR3","volume-title":"Optimization Over Integers","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Weismantel, R.: Optimization Over Integers, vol. 13. Dynamic Ideas, Belmont (2005)"},{"key":"920_CR4","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Jez, L., Sgall, J.: Better approximation bounds for the joint replenishment problem. arXiv preprint arXiv:1307.2531 (2013)","DOI":"10.1137\/1.9781611973402.4"},{"key":"920_CR5","unstructured":"Chan L, Muriel, A., Shen, Z., Simchi-Levi, D., Teo, C.: Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Manag. Sci. 48(11), 1446\u20131460 (2002)"},{"issue":"3","key":"920_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"920_CR7","unstructured":"Federgruen, A., Tzur, M.: The joint replenishment problem with time-varying costs and demands: efficient, asymptotic and $$\\varepsilon $$-optimal solutions. Oper. Res. 42(6), 1067\u20131086 (1994)"},{"issue":"2","key":"920_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1287\/opre.40.2.384","volume":"40","author":"A Federgruen","year":"1992","unstructured":"Federgruen, A., Zheng, Y.: The joint replenishment problem with general joint cost structures. Oper. Res. 40(2), 384\u2013403 (1992)","journal-title":"Oper. Res."},{"issue":"4","key":"920_CR9","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1287\/moor.17.4.951","volume":"17","author":"A Federgruen","year":"1992","unstructured":"Federgruen, A., Queyranne, M., Zheng, Y.S.: Simple power-of-two policies are close to optimal in a general class of production\/distribution networks with general joint setup costs. Math. Oper. Res. 17(4), 951\u2013963 (1992)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"920_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/opre.45.1.102","volume":"45","author":"Y Herer","year":"1997","unstructured":"Herer, Y., Roundy, R.: Heuristics for a one-warehouse multiretailer distribution problem with performance bounds. Oper. Res. 45(1), 102\u2013115 (1997)","journal-title":"Oper. Res."},{"issue":"4","key":"920_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1287\/opre.38.4.711","volume":"38","author":"D Joneja","year":"1990","unstructured":"Joneja, D.: The joint replenishment problem: new heuristics and worst case performance bounds. Oper. Res. 38(4), 711\u2013723 (1990)","journal-title":"Oper. Res."},{"key":"920_CR12","unstructured":"Kao, E.: A multi-product dynamic lot-size model with individual and joint set-up costs. Oper. Res. 27(2), 279\u2013289 (1979)"},{"key":"920_CR13","doi-asserted-by":"crossref","unstructured":"Khanna, S., Naor, J.S., Raz, D.: Control message aggregation in group communication protocols. In: Automata, Languages and Programming, pp. 135\u2013146. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45465-9_13"},{"issue":"2","key":"920_CR14","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.: Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31(2), 267\u2013284 (2006)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"920_CR15","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., Sviridenko, M.: A constant approximation algorithm for the one-warehouse multiretailer problem. Manag. Sci. 54(4), 763 (2008)","journal-title":"Manag. Sci."},{"key":"920_CR16","unstructured":"Levi, R., Magnanti, T., Zarybnisky, E.: Maintenance scheduling for modular systems-models and algorithms. PhD thesis, Massachusetts Institute of Technology (2011)"},{"key":"920_CR17","unstructured":"Nagarajan, V., Shi, C.: Approximation algorithms for inventory problems with submodular or routing costs. arXiv preprint arXiv:1504.06560 (2015)"},{"key":"920_CR18","doi-asserted-by":"crossref","unstructured":"Nonner, T., Souza, A.: A 5\/3-approximation algorithm for joint replenishment with deadlines. In: Combinatorial Optimization and Applications, pp 24\u201335. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02026-1_3"},{"key":"920_CR19","doi-asserted-by":"crossref","unstructured":"Nonner, T., Sviridenko, M.: An efficient polynomial-time approximation scheme for the joint replenishment problem. In: Integer Programming and Combinatorial Optimization, pp 314\u2013323. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_27"},{"issue":"2","key":"920_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118(2), 237\u2013251 (2009)","journal-title":"Math. Program."},{"key":"920_CR21","doi-asserted-by":"crossref","unstructured":"Queyranne, M.: A polynomial-time, submodular extension to roundy\u2019s 98% effective heuristic for production\/inventory. In: Robotics and Automation. Proceedings. 1986 IEEE International Conference on, IEEE, vol 3, pp. 1640\u20131640. (1986)","DOI":"10.1109\/ROBOT.1986.1087515"},{"key":"920_CR22","unstructured":"Roundy, R.: 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Manag. Sci. 31(11), 1416\u20131430 (1985)"},{"key":"920_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"key":"920_CR24","doi-asserted-by":"crossref","unstructured":"Schulz, A.S., Telha, C.: Approximation algorithms and hardness results for the joint replenishment problem with constant demands. In: Algorithms-ESA 2011, pp. 628\u2013639. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-23719-5_53"},{"key":"920_CR25","unstructured":"Segev, D.: An approximate dynamic-programming approach to the joint replenishment problem. Math. Oper. Res. 39(2), 432\u2013444 (2013)"},{"key":"920_CR26","doi-asserted-by":"crossref","unstructured":"Stauffer, G., Massonnet, G., Rapine, C., Gayon, J.: A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics (2011)","DOI":"10.1137\/1.9781611973082.6"},{"issue":"2","key":"920_CR27","first-page":"37","volume":"6","author":"Z Svitkina","year":"2010","unstructured":"Svitkina, Z., Tardos, E.: Facility location with hierarchical facility costs. ACM Trans. Algorithms (TALG) 6(2), 37 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"920_CR28","unstructured":"Teo, C., Bertsimas, D.: Multistage lot sizing problems via randomized rounding. Oper. Res. 49(4), 599\u2013608 (2001)"},{"key":"920_CR29","unstructured":"Veinott, Jr A.: Minimum concave-cost solution of leontief substitution models of multi-facility inventory systems. Oper. Res. 17(2), 262\u2013291 (1969)"},{"issue":"5","key":"920_CR30","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.1070.0401","volume":"55","author":"S Viswanathan","year":"2007","unstructured":"Viswanathan, S.: An algorithm for determining the best lower bound for the stochastic joint replenishment problem. Oper. Res. 55(5), 992\u2013996 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"920_CR31","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H Wagner","year":"1958","unstructured":"Wagner, H., Whitin, T.: Dynamic version of the economic lot size model. Manag.Sci. 5(1), 89\u201396 (1958)","journal-title":"Manag.Sci."},{"key":"920_CR32","unstructured":"Zangwill, W.: A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach. Manag. Sci. 15(9), 506\u2013527 (1969)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0920-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0920-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0920-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0920-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T20:32:24Z","timestamp":1717965144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0920-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,3]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["920"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0920-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,3]]},"assertion":[{"value":"10 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}