{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:45Z","timestamp":1751429445847,"version":"3.41.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1023\/a:1008379621400","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"121-139","source":"Crossref","is-referenced-by-count":18,"title":["Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks"],"prefix":"10.1007","volume":"19","author":[{"given":"Rainer E.","family":"Burkard","sequence":"first","affiliation":[]},{"given":"Helidon","family":"Dollani","sequence":"additional","affiliation":[]},{"given":"Phan Thien","family":"Thach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"311025_CR1","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R.E. Erickson","year":"1987","unstructured":"Erickson, R.E., Monma, C.L. and Veinott Jr., A.F. (1987), Send-and-split method for minimumconcave-cost network flows, Mathematics of Operations Research 12: 634\u2013664.","journal-title":"Mathematics of Operations Research"},{"key":"311025_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","volume":"1","author":"J.E. Falk","year":"1976","unstructured":"Falk, J.E. and Hoffman, K.L. (1976), A successive underestimation method for concave minimization problems, Mathematics of Operations Research 1: 251\u2013259.","journal-title":"Mathematics of Operations Research"},{"key":"311025_CR3","volume-title":"Flows in Networks","author":"L. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R. and Fulkerson, D.R. (1962), Flows in Networks, Princeton University Press, Princeton, New Jersey."},{"key":"311025_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(80)90109-5","volume":"4","author":"G. Gallo","year":"1980","unstructured":"Gallo, G., Sandi, C. and Sodini, C. (1980), An algorithm for the min concave cost flow problem, European Journal of Operational Research 4: 248\u2013259.","journal-title":"European Journal of Operational Research"},{"key":"311025_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"G.M. Guisewite","year":"1990","unstructured":"Guisewite, G.M. and Pardalos, P.M. (1990), Minimum concave-cost network flow problems: applications, complexity, and algorithms, Annals of Operations Research 25: 75\u2013100.","journal-title":"Annals of Operations Research"},{"key":"311025_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00119934","volume":"1","author":"G.M. Guisewite","year":"1991","unstructured":"Guisewite, G.M. and Pardalos, P.M. (1991), Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. Journal of Global Optimization 1: 245\u2013265.","journal-title":"Journal of Global Optimization"},{"key":"311025_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/dimacs\/040\/09","volume":"40","author":"K. Holmqvist","year":"1998","unstructured":"Holmqvist, K., Migdalas, A. and Pardalos, P.M. (1998), A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 40: 131\u2013142.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"311025_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"1999","unstructured":"Kim, D. and Pardalos, P.M. (1999), A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Operations Research Letters 24: 195\u2013203.","journal-title":"Operations Research Letters"},{"key":"311025_CR9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D. Kim","year":"2000","unstructured":"Kim, D. and Pardalos, P.M. (2000), Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Networks 35: 216\u2013222.","journal-title":"Networks"},{"key":"311025_CR10","doi-asserted-by":"crossref","unstructured":"Klinz, B. and Tuy, H. (1993), Minimum concave-cost network flow problems with a single nonlinear arc cost, in: P. Pardalos and D. Du (eds.), Network Optimization Problems, World Scientific, pp. 125\u2013143.","DOI":"10.1142\/9789812798190_0008"},{"key":"311025_CR11","doi-asserted-by":"crossref","unstructured":"Tuy, H. (2000), The minimum concave-cost network flow problem with a fixed number of nonlinear arc costs: complexity and approximation, in: P.M. Pardalos (ed.), Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, Kluwer Academic Publishers, pp. 383-402.","DOI":"10.1007\/978-1-4757-3145-3_30"},{"key":"311025_CR12","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. and V\u00e4rbrand, P. (1996), A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, Mathematical Programming 72: 229\u2013258.","journal-title":"Mathematical Programming"},{"key":"311025_CR13","volume-title":"Principles of Operations Research","author":"H.M. Wagner","year":"1975","unstructured":"Wagner, H.M. (1975), Principles of Operations Research, 2nd edition, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.","edition":"2nd edition"},{"key":"311025_CR14","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W.I. Zangwill","year":"1968","unstructured":"Zangwill, W.I. (1968), Minimum concave cost flows in certain networks, Management Science 14: 429\u2013450.","journal-title":"Management Science"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008379621400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008379621400\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008379621400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:47:43Z","timestamp":1751366863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008379621400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["311025"],"URL":"https:\/\/doi.org\/10.1023\/a:1008379621400","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}