{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T09:38:45Z","timestamp":1701769125736},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,16]],"date-time":"2014-02-16T00:00:00Z","timestamp":1392508800000},"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":[[2015,4]]},"DOI":"10.1007\/s10107-014-0752-6","type":"journal-article","created":{"date-parts":[[2014,2,17]],"date-time":"2014-02-17T14:41:18Z","timestamp":1392648078000},"page":"79-98","source":"Crossref","is-referenced-by-count":12,"title":["Minimum concave cost flow over a grid network"],"prefix":"10.1007","volume":"150","author":[{"given":"Qie","family":"He","sequence":"first","affiliation":[]},{"given":"Shabbir","family":"Ahmed","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,16]]},"reference":[{"issue":"3","key":"752_CR1","doi-asserted-by":"crossref","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. 41(3), 549\u2013571 (1993)","journal-title":"Oper. Res."},{"key":"752_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"issue":"4","key":"752_CR3","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.1050.0223","volume":"53","author":"A Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk, A., K\u00fc\u00e7\u00fckyavuz, S.: Lot sizing with inventory bounds and fixed costs: polyhedral study and computation. Oper. Res. 53(4), 711\u2013730 (2005)","journal-title":"Oper. Res."},{"issue":"3","key":"752_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.orl.2007.08.004","volume":"36","author":"A Atamt\u00fcrk","year":"2008","unstructured":"Atamt\u00fcrk, A., K\u00fc\u00e7\u00fckyavuz, S.: An $${O}(n^2)$$ O ( n 2 ) algorithm for lot sizing with inventory bounds and fixed costs. Oper. Res. Lett. 36(3), 297\u2013299 (2008)","journal-title":"Oper. Res. Lett."},{"key":"752_CR5","volume-title":"Reverse Logistics: Quantitative Models for Closed-Loop Supply Chains","year":"2004","unstructured":"Dekker, R., Fleischmann, M., Inderfurth, K., Van Wassenhove, L.N. (eds.): Reverse Logistics: Quantitative Models for Closed-Loop Supply Chains. Springer, Berlin (2004)"},{"issue":"4","key":"752_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"RE Erickson","year":"1987","unstructured":"Erickson, R.E., Monma, C.L., Veinott Jr, A.F.: Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12(4), 634\u2013664 (1987)","journal-title":"Math. Oper. Res."},{"issue":"8","key":"752_CR7","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$$ n periods in $${O}(n\\log n)$$ O ( n log n ) or $${O}(n)$$ O ( n ) time. Manag. Sci. 37(8), 909\u2013925 (1991)","journal-title":"Manag. Sci."},{"issue":"1","key":"752_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/mnsc.18.1.12","volume":"18","author":"M Florian","year":"1971","unstructured":"Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Manag. Sci. 18(1), 12\u201320 (1971)","journal-title":"Manag. Sci."},{"issue":"1","key":"752_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"GM Guisewite","year":"1990","unstructured":"Guisewite, G.M., Pardalos, P.M.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25(1), 75\u201399 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"752_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230230208","volume":"23","author":"GM Guisewite","year":"1993","unstructured":"Guisewite, G.M., Pardalos, P.M.: A polynomial time solvable concave network flow problem. Networks 23(2), 143\u2013147 (1993)","journal-title":"Networks"},{"issue":"11","key":"752_CR11","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1080\/07408170304401","volume":"35","author":"P Kaminsky","year":"2003","unstructured":"Kaminsky, P., Simchi-Levi, D.: Production and distribution lot sizing in a two stage supply chain. IIE Trans. 35(11), 1065\u20131075 (2003)","journal-title":"IIE Trans."},{"issue":"6","key":"752_CR12","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"R Martin","year":"1987","unstructured":"Martin, R.: Generating alternative mixed-integer programming models using variable redefinition. Oper. Res. 35(6), 820\u2013831 (1987)","journal-title":"Oper. Res."},{"key":"752_CR13","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)"},{"issue":"2","key":"752_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01096764","volume":"6","author":"H Tuy","year":"1995","unstructured":"Tuy, H., Ghannadan, S., Migdalas, A., V\u00e4rbrand, P.: The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs. J. Glob. Optim. 6(2), 135\u2013151 (1995)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"752_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02592091","volume":"72","author":"H Tuy","year":"1996","unstructured":"Tuy, H., Ghannadan, S., Migdalas, A., V\u00e4rbrand, P.: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables. Math. Program. 72(3), 229\u2013258 (1996)","journal-title":"Math. Program."},{"issue":"4","key":"752_CR16","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.orl.2007.12.003","volume":"36","author":"W Heuvel van den","year":"2008","unstructured":"van den Heuvel, W., Wagelmans, A.P.: Four equivalent lot-sizing models. Oper. Res. Lett. 36(4), 465\u2013470 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"752_CR17","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1287\/mnsc.1050.0378","volume":"51","author":"S Hoesel van","year":"2005","unstructured":"van Hoesel, S., Romeijn, H.E., Morales, D.R., Wagelmans, A.P.: Integrated lot sizing in serial supply chains with production capacities. Manag. Sci. 51(11), 1706\u20131719 (2005)","journal-title":"Manag. Sci."},{"issue":"1","key":"752_CR18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A Wagelmans","year":"1992","unstructured":"Wagelmans, A., van Hoesel, S., Kolen, A.: Economic lot sizing: an $${O}(n\\log n)$$ O ( n log n ) algorithm that runs in linear time in the Wagner\u2013Whitin case. Oper. Res. 40(1), 145\u2013156 (1992)","journal-title":"Oper. Res."},{"issue":"1","key":"752_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manag. Sci. 5(1), 89\u201396 (1958)","journal-title":"Manag. Sci."},{"issue":"7","key":"752_CR20","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"WI Zangwill","year":"1968","unstructured":"Zangwill, W.I.: Minimum concave cost flows in certain networks. Manag. Sci. 14(7), 429\u2013450 (1968)","journal-title":"Manag. Sci."},{"issue":"9","key":"752_CR21","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.: 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)","journal-title":"Manag. Sci."},{"issue":"4","key":"752_CR22","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.: A polyhedral study of multi-echelon lot sizing with intermediate demands. Oper. Res. 60(4), 918\u2013935 (2012)","journal-title":"Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0752-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0752-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0752-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:04Z","timestamp":1559124004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0752-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,16]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["752"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0752-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,16]]}}}