{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:54:21Z","timestamp":1770479661606,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,25]],"date-time":"2009-11-25T00:00:00Z","timestamp":1259107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10107-009-0310-9","type":"journal-article","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T05:48:49Z","timestamp":1259041729000},"page":"85-106","source":"Crossref","is-referenced-by-count":39,"title":["Approximation algorithms for supply chain planning and logistics problems with market choice"],"prefix":"10.1007","volume":"130","author":[{"given":"Joseph","family":"Geunes","sequence":"first","affiliation":[]},{"given":"Retsef","family":"Levi","sequence":"additional","affiliation":[]},{"given":"H. Edwin","family":"Romeijn","sequence":"additional","affiliation":[]},{"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,25]]},"reference":[{"key":"310_CR1","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.41.3.549","volume":"14","author":"A. Aggarwal","year":"1993","unstructured":"Aggarwal A., Park J.K.: Improved algorithms for economic lot-sizing problems. Oper. Res. 14, 549\u2013571 (1993)","journal-title":"Oper. Res."},{"key":"310_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.: Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8, 61\u201366 (1989)","journal-title":"Oper. Res. Lett."},{"key":"310_CR3","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas E.: The prize collection travelling salesman problem. Networks 19, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"310_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","volume":"22","author":"I. B\u00e1r\u00e1ny","year":"1984","unstructured":"B\u00e1r\u00e1ny I., Van Roy T.J., Wolsey L.A.: Uncapacitated lot-sizing: the convex hull of solutions. Math. Program. Study 22, 32\u201343 (1984)","journal-title":"Math. Program. Study"},{"key":"310_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y. Bartal","year":"2000","unstructured":"Bartal Y., Leonardi S., Spaccamela A.M., Sgall J., Stougie L.: Multiprocessor scheduling with rejection. SIAM J. Discret. Math. 13, 64\u201378 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"310_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(99)00010-3","volume":"25","author":"D. Bertsimas","year":"1999","unstructured":"Bertsimas D., Teo C., Vohra R.: On dependent randomized rounding algorithms. Oper. Res. Lett. 25, 105\u2013114 (1999)","journal-title":"Oper. Res. Lett."},{"key":"310_CR7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock D., Goemans M.X., Simchi-Levi D., Williamson D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413\u2013420 (1993)","journal-title":"Math. Program."},{"key":"310_CR8","doi-asserted-by":"crossref","unstructured":"Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of APPROX-RANDOM, pp. 29\u201343 (2007)","DOI":"10.1007\/978-3-540-74208-1_3"},{"key":"310_CR9","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1287\/mnsc.48.11.1446.267","volume":"48","author":"A. Chan","year":"2000","unstructured":"Chan A., Muriel A., Shen Z.-J., Simchi-Levi D., Teo C.-P.: Effectiveness of zero inventory ordering policies for an one-warehouse multi-retailer problem with piecewise linear cost structures. Manage. Sci. 48, 1446\u20131460 (2000)","journal-title":"Manage. Sci."},{"key":"310_CR10","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"310_CR11","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the capacitated facility location problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. S875\u2013S876, (1999)"},{"key":"310_CR12","doi-asserted-by":"crossref","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 log n) or O(n) time. Manage. Sci. 37, 909\u2013925 (1991)","journal-title":"Manage. Sci."},{"key":"310_CR13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige U.: A threshold of ln(n) for approximating set-cover. J. ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"310_CR14","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1287\/opre.1050.0255","volume":"54","author":"J. Geunes","year":"2006","unstructured":"Geunes J., Romeijn H.E., Taaffe K.: Requirements planning with order selection flexibility. Oper. Res. 54, 394\u2013401 (2006)","journal-title":"Oper. Res."},{"key":"310_CR15","unstructured":"Goemans, M.X.: Approximate solutions of hard combinatorial problems, Lecture notes in the school of ASHCOMP (1996)"},{"key":"310_CR16","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"310_CR17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0377-2217(91)90166-S","volume":"52","author":"A.V. Hoesel","year":"1991","unstructured":"Hoesel A.V., Wagelmans A., Kolen A.: A dual algorithm for the economic lot-sizing problem. Eur. J. Oper. Res. 52, 315\u2013325 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"310_CR18","doi-asserted-by":"crossref","unstructured":"Krarup, J., Bilde, O.: Plant location, set covering and economic lot sizing: an O(mn) algorithm for structured problems. In: Numerische Methoden Bei Optimierungsaufgaben, vol. 3, pp. 155\u2013180 (1977)","DOI":"10.1007\/978-3-0348-5936-3_10"},{"key":"310_CR19","doi-asserted-by":"crossref","unstructured":"Levi, R., Geunes, J., Romeijn, E.H., Shmoys, D.B.: Inventory and facility location models with market selection. In: Proceedings of the 12th IPCO, pp. 111\u2013124, (2005)","DOI":"10.1007\/11496915_9"},{"key":"310_CR20","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.: Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31, 267\u2013284 (2006)","journal-title":"Math. Oper. Res."},{"key":"310_CR21","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.O., Shmoys D.B., Sviridenko M.: A constant approximation algorithm for the one-warehouse multi-retailer problem. Manage. Sci. 54, 763\u2013776 (2008)","journal-title":"Manage. Sci."},{"key":"310_CR22","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Stratila, D.: Separable concave optimization approximately equals piecewise linear optimization. In: Proceedings of the 11th IPCO, pp. 234\u2013243 (2004)","DOI":"10.1007\/978-3-540-25960-2_18"},{"key":"310_CR23","unstructured":"Magnanti, T.L., Stratila, D.: Strongly polynomial algorithms for concave cost combinatorial optimization problems. (2007) (in preparation)"},{"key":"310_CR24","volume-title":"Comparison Methods for Stochastic Models and Risks","author":"A. M\u00fcller","year":"2002","unstructured":"M\u00fcller A., Stoyan D.: Comparison Methods for Stochastic Models and Risks. Wiley, London (2002)"},{"key":"310_CR25","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","volume":"18","author":"Y. Pochet","year":"1993","unstructured":"Pochet Y., Wolsey L.A.: Lot-sizing with constant batches: formulation and valid inequalities. Math. Oper. Res. 18, 767\u2013785 (1993)","journal-title":"Math. Oper. Res."},{"key":"310_CR26","unstructured":"van den Heuvel, W., Kundakcioglu, O.E., Geunes, J., Romeijn, H.E., Sharkey, T.C., Wagelmans, A.P.M.: Integrated market selection and production planning: complexity and solution approaches. Unpublished manuscript (2009)"},{"key":"310_CR27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A.P.M. Wagelmans","year":"1992","unstructured":"Wagelmans A.P.M., van Hoesel C.P.M., Kolen A.: Economic lot-sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40, 145\u2013156 (1992)","journal-title":"Oper. Res."},{"key":"310_CR28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H.M. Wagner","year":"1958","unstructured":"Wagner H.M., Whitin T.M.: Dynamic version of the economic lot sizing model. Manage. Sci. 5, 89\u201396 (1958)","journal-title":"Manage. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0310-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0310-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0310-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:07Z","timestamp":1559109007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0310-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,25]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["310"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0310-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,25]]}}}