{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:17:19Z","timestamp":1771913839524,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,13]],"date-time":"2015-12-13T00:00:00Z","timestamp":1449964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Coordination for the Improvement of Higher Education Personnel (CAPES), Brazil"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10479-015-2073-4","type":"journal-article","created":{"date-parts":[[2015,12,13]],"date-time":"2015-12-13T05:27:40Z","timestamp":1449984460000},"page":"99-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On reformulations for the one-warehouse multi-retailer problem"],"prefix":"10.1007","volume":"238","author":[{"given":"Jesus O.","family":"Cunha","sequence":"first","affiliation":[]},{"given":"Rafael A.","family":"Melo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,13]]},"reference":[{"key":"2073_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.01.011","volume":"55","author":"Y Adulyasak","year":"2015","unstructured":"Adulyasak, Y., Cordeau, J. F., & Jans, R. (2015). The production routing problem: A review of formulations and solution algorithms. Computers & Operations Research, 55, 141\u2013152.","journal-title":"Computers & Operations Research"},{"key":"2073_CR2","doi-asserted-by":"crossref","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. (1989). Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8, 61\u201366.","journal-title":"Operations Research Letters"},{"issue":"5","key":"2073_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<463::AID-NAV2>3.0.CO;2-S","volume":"46","author":"A Federgruen","year":"1999","unstructured":"Federgruen, A., & Tzur, M. (1999). Time-partitioning heuristics : Application to one warehouse, multiitem, multiretailer lot-sizing problems. Naval Research Logistics, 46(5), 463\u2013486.","journal-title":"Naval Research Logistics"},{"key":"2073_CR4","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press."},{"key":"2073_CR5","doi-asserted-by":"crossref","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. (2008). A constant approximation algorithm for the one-warehouse multi-retailer problem. Management Science, 54, 763\u2013776.","journal-title":"Management Science"},{"key":"2073_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/moor.1050.0178","volume":"31","author":"R Levi","year":"2006","unstructured":"Levi, R., Roundy, R. O., & Shmoys, D. B. (2006). Primal-dual algorithms for deterministic inventory problems. Mathematics of Operations Research, 31, 267\u2013284.","journal-title":"Mathematics of Operations Research"},{"key":"2073_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.orl.2010.04.001","volume":"38","author":"RA Melo","year":"2010","unstructured":"Melo, R. A., & Wolsey, L. A. (2010). Uncapacitated two-level lot-sizing. Operations Research Letters, 38, 241\u2013245.","journal-title":"Operations Research Letters"},{"issue":"11","key":"2073_CR8","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1016\/j.cor.2012.02.011","volume":"39","author":"RA Melo","year":"2012","unstructured":"Melo, R. A., & Wolsey, L. A. (2012). MIP formulations and heuristics for two-level production-transportation problems. Computers & Operations Research, 39(11), 2776\u20132786.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"2073_CR9","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1080\/00207540412331327718","volume":"43","author":"YB Park","year":"2005","unstructured":"Park, Y. B. (2005). An integrated approach for production and distribution planning in supply chain management. International Journal of Production Research, 43(6), 1205\u20131224.","journal-title":"International Journal of Production Research"},{"key":"2073_CR10","volume-title":"Production planning by mixed integer programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., & Wolsey, L. A. (2006). Production planning by mixed integer programming. New York: Springer."},{"key":"2073_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","volume":"71","author":"RL Rardin","year":"1993","unstructured":"Rardin, R. L., & Wolsey, L. A. (1993). Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. European Journal of Operational Research, 71, 95\u2013109.","journal-title":"European Journal of Operational Research"},{"key":"2073_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.omega.2006.11.004","volume":"37","author":"P Robinson","year":"2009","unstructured":"Robinson, P., Narayanan, A., & Sahin, F. (2009). Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms. Omega, 37, 3\u201315.","journal-title":"Omega"},{"issue":"3","key":"2073_CR13","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/j.cor.2003.08.002","volume":"32","author":"M Sambasivan","year":"2005","unstructured":"Sambasivan, M., & Yahya, S. (2005). A lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Computers & Operations Research, 32(3), 537\u2013555.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2073_CR14","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10479-011-1022-0","volume":"196","author":"O Solyali","year":"2012","unstructured":"Solyali, O., & S\u00fcral, H. (2012). The one-warehouse multi-retailer problem: Reformulation, classification, and computational results. Annals of Operations Research, 196(1), 517\u2013541.","journal-title":"Annals of Operations Research"},{"key":"2073_CR15","doi-asserted-by":"crossref","unstructured":"Stauffer, G., Massonnet, G., Rapine, C. & Gayon, J.P. (2011). A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem. In Proceedings of the twenty-second annual ACM-SIAM symposium on discrete algorithms, SODA\u201911 (pp. 67\u201379). San Francisco, SIAM.","DOI":"10.1137\/1.9781611973082.6"},{"key":"2073_CR16","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"WI Zangwill","year":"1969","unstructured":"Zangwill, W. I. (1969). A backlogging model and a multi-echelon model of a dynamic economic lot size production system - a network approach. Management Science, 15, 506\u2013526.","journal-title":"Management Science"},{"key":"2073_CR17","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1287\/opre.1120.1058","volume":"60","author":"M Zhang","year":"2012","unstructured":"Zhang, M., K\u00fc\u00e7\u00fckyavuz, S., & Yaman, H. (2012). A polyhedral study of multiechelon lot sizing with intermediate demands. Operations Research, 60, 918\u2013935.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2073-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2073-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2073-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:17Z","timestamp":1559153357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2073-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,13]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["2073"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2073-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,13]]}}}