{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:28:56Z","timestamp":1752229736482},"reference-count":22,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7894,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a minimum\u2010cost dynamic network\u2010flow problem on a very special network. This network flow problem models an infinite\u2010horizon, lot\u2010sizing problem with deterministic demand and periodic data. We permit two different objectives: minimize long\u2010run average\u2010cost per period and minimize the discounted cost. In both cases we give polynomial algorithms when certain arc costs are fixed charge functions, and others are linear.<\/jats:p>","DOI":"10.1002\/net.3230150107","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T19:18:53Z","timestamp":1178911133000},"page":"59-71","source":"Crossref","is-referenced-by-count":17,"title":["A minimum concave\u2010cost dynamic network flow problem with an application to lot\u2010sizing"],"prefix":"10.1002","volume":"15","author":[{"given":"Stephen C.","family":"Graves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"15","author":"Bellman R. E.","year":"1958","journal-title":"Q. Appl. Math."},{"key":"e_1_2_1_3_2","unstructured":"S.Chand andT. E.Morton Perfect Planning Horizon Procedures for the Dynamic Lot Size Inventory Model. Working paper August1979."},{"key":"e_1_2_1_4_2","first-page":"77","volume-title":"Theory of Graphs","author":"Dantzig G. B.","year":"1967"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.15.5.268"},{"key":"e_1_2_1_6_2","unstructured":"R. E.Erickson C. L.MonmaandA. F.VeinottJr. Minimum concave\u2010cost network flows.Math. Operations Res. in press."},{"key":"e_1_2_1_7_2","volume-title":"Computers and Intractibility: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"e_1_2_1_9_2","volume-title":"Dynamic Programming and Markov Processes","author":"Howard R. A.","year":"1960"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90026-3"},{"key":"e_1_2_1_11_2","first-page":"1093","article-title":"A polynomial algorithm for linear programming","volume":"244","author":"Khachian L. G.","year":"1979","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"e_1_2_1_12_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_13_2","first-page":"209","volume-title":"Theory of Graphs","author":"Lawler E. L.","year":"1967"},{"key":"e_1_2_1_14_2","volume-title":"Introduction to Dynamic Systems: Theory Models and Applications","author":"Luenberger D. G.","year":"1979"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.4.711"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"N.Megiddo Combinatorial optimization with rational objective functions. In Proceedings of the 10th ACM Symposium on the Theory of Computing (1978) pp.1\u201312.","DOI":"10.1145\/800133.804326"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"J. B.Orlin The complexity of dynamic languages and dynamic optimization problems. In Proceedings of the 13th ACM Symposium on the Theory of Computing (1981) pp.218\u2013227.","DOI":"10.1145\/800076.802475"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.9.2.190"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.89"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.10.3.465"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.15.9.506"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.14.7.429"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(81)90023-7"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T15:45:10Z","timestamp":1697816710000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["10.1002\/net.3230150107"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150107","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}