{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:34Z","timestamp":1751429434957,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":[[2000,9]]},"DOI":"10.1023\/a:1026502220076","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T17:11:16Z","timestamp":1068138676000},"page":"225-234","source":"Crossref","is-referenced-by-count":35,"title":["A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*"],"prefix":"10.1007","volume":"17","author":[{"given":"Dukwon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"271388_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/02331938808843335","volume":"19","author":"C.T. Bornstein","year":"1988","unstructured":"Bornstein, C.T. and Rust, R. (1988), Minimizing a sum of staircase functions under linear constraints, Optimization 19: pp. 181-190.","journal-title":"Optimization"},{"key":"271388_CR2","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-100.","journal-title":"Annals of Operations Research"},{"key":"271388_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00130828","volume":"1","author":"G.M. Guisewite","year":"1991","unstructured":"Guisewite, G.M. and Pardalos, P.M. (1991), Global search algorithms for minimum concave cost network flow problems, Journal of Global Optimization 1: 309-330.","journal-title":"Journal of Global Optimization"},{"key":"271388_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0377-2217(94)90184-8","volume":"75","author":"K. Holmberg","year":"1994","unstructured":"Holmberg, K. (1994), Solving the staircase cost facility location problem with decomposition and piecewise linearization, European Journal of Operational Research 75: 41-61.","journal-title":"European Journal of Operational Research"},{"key":"271388_CR5","doi-asserted-by":"crossref","unstructured":"Horst, R. and Pardalos, P.M. (eds.), (1995), Handbook of Global Optimization, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-2025-2"},{"issue":"4","key":"271388_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"2000","unstructured":"Kim, D. and Pardalos, P.M. (2000), A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Operations Research Letters 24(4): 195-203.","journal-title":"Operations Research Letters"},{"key":"271388_CR7","unstructured":"Kim, D. and Pardalos, P.M. (2000), Piecewise linear network flow problems, in: A. Mig-dalas, P.M. Pardalos and P. Varbrand (eds.), Local to Global Optimization, Kluwer Academic Publishers."},{"key":"271388_CR8","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 concave piecewise linear network flow problems, Networks 35: 216-222.","journal-title":"Networks"},{"key":"271388_CR9","doi-asserted-by":"crossref","unstructured":"Lamar, B.W. (1993), A method for solving network flow problems with general nonlinear arc costs, in: D.-Z. Du, and P. M. Pardalos, (eds.), Network Optimization Problems,World Scientific Publishing Co., 147-167.","DOI":"10.1142\/9789812798190_0009"},{"key":"271388_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and Wolsey, L.A. (1988), Integer and Combinatorial Optimization, John Wiley and Sons Inc., New York."},{"key":"271388_CR11","volume-title":"Lecture Notes in Computer Science","author":"P.M. Pardalos","year":"1987","unstructured":"Pardalos, P.M. and Rosen, J.B. (1987), Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268, Springer-Verlag, Berlin."},{"key":"271388_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01720032","volume":"10","author":"P.M. Pardalos","year":"1988","unstructured":"Pardalos, P.M. (1988), Enumerative techniques for solving some nonconvex global optimization problems, OR Spectrum 10: 29-35.","journal-title":"OR Spectrum"},{"issue":"2","key":"271388_CR13","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.16.2.390","volume":"16","author":"L.S. Thakur","year":"1991","unstructured":"Thakur, L.S. (1991), Domain contraction in nonlinear programming: Minimizing a quadratic concave objective over a polyhedron, Mathematics of Operations Research 16(2) 390-407.","journal-title":"Mathematics of Operations Research"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026502220076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026502220076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026502220076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:40:05Z","timestamp":1751366405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026502220076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["271388"],"URL":"https:\/\/doi.org\/10.1023\/a:1026502220076","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}