{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:09Z","timestamp":1752378009082,"version":"3.41.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1008667714641","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"107-126","source":"Crossref","is-referenced-by-count":7,"title":["A Partitioned \u2208-Relaxation Algorithm for Separable Convex Network Flow Problems"],"prefix":"10.1007","volume":"12","author":[{"given":"Renato","family":"De Leone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert R.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armand","family":"Zakarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"190485_CR1","volume-title":"Linear Network Optimization: Algorithms and Codes","author":"D. Bertsekas","year":"1991","unstructured":"D. Bertsekas, Linear Network Optimization: Algorithms and Codes, The MIT Press: Cambridge, MA, 1991."},{"key":"190485_CR2","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1137\/0325067","volume":"25","author":"D.P. Bertsekas","year":"1987","unstructured":"D.P. Bertsekas, P.A. Hosein, and P. Tseng, \u201cRelaxation methods for network flow problems with convex arc costs,\u201d SIAM Journal on Control and Optimization, vol. 25, pp. 1219\u20131243, 1987.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"190485_CR3","first-page":"953","volume":"7","author":"D. Bertsekas","year":"1997","unstructured":"D. Bertsekas, L. Polymenakos, and P. Tseng, \u201cAn \u03b5-relaxation method for separable convex cost network flow problems,\u201d SIAM Journal on Optimization, vol. 7, pp. 953\u2013970, 1997.","journal-title":"SIAM Journal on Optimization"},{"key":"190485_CR4","volume-title":"Parallel and Distributed Computation","author":"D. Bertsekas","year":"1989","unstructured":"D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation, Prentice Hall: Englewood Cliffs, NJ, 1989."},{"key":"190485_CR5","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1287\/mnsc.24.7.747","volume":"24","author":"M. Collins","year":"1978","unstructured":"M. Collins, L. Cooper, R. Helgason, J. Kennington, and L. LeBlanc, \u201cSolving the pipe network analysis problem using optimization techniques,\u201d Management Science, vol. 24, pp. 747\u2013760, 1978.","journal-title":"Management Science"},{"key":"190485_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3800130102","volume":"13","author":"T. Hu","year":"1966","unstructured":"T. Hu, \u201cMinimum cost flows in convex cost networks,\u201d Naval Research Logistics Quarterly, vol. 13, pp. 1\u20139, 1966.","journal-title":"Naval Research Logistics Quarterly"},{"key":"190485_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BFb0121016","volume":"22","author":"P. Kamesam","year":"1984","unstructured":"P. Kamesam and R. Meyer, \u201cMultipoint methods for separable nonlinear networks,\u201d Mathematical Programming Study, vol. 22, pp. 185\u2013205, 1984.","journal-title":"Mathematical Programming Study"},{"key":"190485_CR8","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"D. Klingman, A. Napier, and J. Stutz, \u201cNETGEN\u2014A program for generation of large-scale (un)capacitated assignment, transportation and minimum cost network problems,\u201d Management Science, vol. 20, pp. 814\u2013822, 1974.","journal-title":"Management Science"},{"key":"190485_CR9","first-page":"153","volume-title":"Transportation Planning Models","author":"T. Magnanti","year":"1984","unstructured":"T. Magnanti, \u201cModels and algorithms for predicting urban traffic equilibria,\u201d in Transportation Planning Models, M. Florian (Ed.), North-Holland: Amsterdam, 1984, pp. 153\u2013186."},{"key":"190485_CR10","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/j.1538-7305.1982.tb04325.x","volume":"61","author":"C. Monma","year":"1982","unstructured":"C. Monma and M. Segal, \u201cA primal algorithm for finding minimum-cost flows in capacitated networks with applications,\u201d Bell System Technical Journal, vol. 61, pp. 449\u2013468, 1982.","journal-title":"Bell System Technical Journal"},{"key":"190485_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R. Rockafellar","year":"1970","unstructured":"R. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970."},{"key":"190485_CR12","volume-title":"Network Flows and Monotropic Optimization","author":"R. Rockafellar","year":"1984","unstructured":"R. Rockafellar, Network Flows and Monotropic Optimization, John Wiley: New York, 1984."},{"key":"190485_CR13","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/131766.131771","volume":"18","author":"P. Toint","year":"1992","unstructured":"P. Toint and D. Tuyttens, \u201cLSNNO: A Fortran subroutine for solving large-scale nonlinear network optimization problems,\u201d ACM Transactions on Mathematical Software, vol. 18, pp. 308\u2013328, 1992.","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008667714641.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008667714641\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008667714641.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:27:55Z","timestamp":1752377275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008667714641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["190485"],"URL":"https:\/\/doi.org\/10.1023\/a:1008667714641","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}