{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:54Z","timestamp":1725664374389},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:28:17Z","timestamp":1330291697000},"page":"85-93","source":"Crossref","is-referenced-by-count":4,"title":["An \u03b5-Relaxation method for generalized separable convex cost network flow problems"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri P.","family":"Bertsekas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.39.6.955","volume":"39","author":"I. Adler","year":"1991","unstructured":"Adler, I., and Cosares, S., A strongly polynomial algorithm for a special class of linear programs, Operations Research 39 (1991) 955\u2013960","journal-title":"Operations Research"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/35078.42181","volume":"13","author":"D.P. Ahlfeld","year":"1987","unstructured":"Ahlfeld, D.P., Mulvey, J.M., Dembo, R.S., and Zenios, S.A., Nonlinear programming on generalized networks, ACM Transactions on Mathematical Software 13 (1987) 350\u2013367","journal-title":"ACM Transactions on Mathematical Software"},{"key":"7_CR3","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network Flows, Prentice-Hall, Englewood Cliffs, 1993"},{"key":"7_CR4","first-page":"1","volume-title":"Network models","author":"R.K. Ahuja","year":"1995","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B., and Reddy, M.R., Applications of network optimization. In: Ball, M.O., Magnanti, T.L., Monma, C.L., and Nemhauser, G.L. (eds.) Network models, North-Holland, Amsterdam, 1995, pp. 1\u201383"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P., Distributed relaxation methods for linear network flow problems, Proceedings of 25th IEEE Conference on Decision and Control (1986) 2101\u20132106","DOI":"10.1109\/CDC.1986.267433"},{"key":"7_CR6","volume-title":"Linear Network Optimization: Algorithms and Codes","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Linear Network Optimization: Algorithms and Codes, M.I.T. Press, Cambridge, 1991"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0927-0507(05)80122-7","volume-title":"Network models","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas, D.P., Castanon, D., Eckstein, J., and Zenios, S.A., Parallel computing in network optimization. In: Ball, M.O., Magnanti, T.L., Monma, C.L., and Nemhauser, G.L. (eds.) Network models, North-Holland, Amsterdam, 1995, pp. 331\u2013399"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1137\/0325067","volume":"25","author":"D.P. Bertsekas","year":"1987","unstructured":"Bertsekas, D.P., Hosein, P.A., and Tseng, P., Relaxation methods for network flow problems with convex arc costs,\u201d SIAM Journal on Control and Optimization 25 (1987) 1219\u20131243","journal-title":"SIAM Journal on Control and Optimization"},{"key":"7_CR9","series-title":"Laboratory for Information and Decision Systems Report","volume-title":"An \u03b5-relaxation method for separable convex cost network flow problems","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas, D.P., Polymenakos, L.C., and Tseng, P., An \u03b5-relaxation method for separable convex cost network flow problems, Laboratory for Information and Decision Systems Report, Massachusetts Institute of Technology, Cambridge, 1995"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.36.1.93","volume":"36","author":"D.P. Bertsekas","year":"1988","unstructured":"Bertsekas, D.P., and Tseng, P., Relaxation methods for minimum cost ordinary and generalized network flow problems, Operations Research 36 (1988) 93\u2013114","journal-title":"Operations Research"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01582579","volume":"64","author":"E. Cohen","year":"1994","unstructured":"Cohen, E., and Megiddo, N., New algorithms for generalized network flows, Mathematical Programming 64 (1994) 325\u2013336","journal-title":"Mathematical Programming"},{"key":"7_CR12","series-title":"Computer Sciences Department Technical Report","volume-title":"An e-relaxation algorithm for convex network flow problems","author":"R. Leone De","year":"1995","unstructured":"De Leone, R., Meyer, R.R., and Zakarian, A., An e-relaxation algorithm for convex network flow problems, Computer Sciences Department Technical Report, University of Wisconsin, Madison, 1995"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1287\/mnsc.24.12.1209","volume":"24","author":"F. Glover","year":"1978","unstructured":"Glover, F., Hultz, J., Klingman, D., and Stutz, J., Generalized networks: a fundamental computer-based planning tool, Management Science 24 (1978) 1209\u20131220","journal-title":"Management Science"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/moor.16.2.351","volume":"16","author":"A.V. Goldberg","year":"1991","unstructured":"Goldberg, A.V., Plotkin, S.A., and Tardos, \u00c9., Combinatorial algorithms for the generalized circulation problem, Mathematics of Operations Research 16 (1991) 351\u2013381","journal-title":"Mathematics of Operations Research"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/opre.10.4.476","volume":"10","author":"W.S. Jewell","year":"1962","unstructured":"Jewell, W.S., Optimal flow through networks with gains, Operations Research 10 (1962) 476\u2013499","journal-title":"Operations Research"},{"key":"7_CR16","series-title":"Faculty of Commerce Report","volume-title":"Polynomial methods for separable convex optimization in unimodular linear spaces with applications to circulations and co-circulations in network","author":"A.V. Karzanov","year":"1993","unstructured":"Karzanov, A.V., and McCormick, S.T., Polynomial methods for separable convex optimization in unimodular linear spaces with applications to circulations and co-circulations in network, Faculty of Commerce Report, University of British Columbia, Vancouver, 1993; SIAM Journal on Computing (to appear)"},{"key":"7_CR17","volume-title":"Network Programming","author":"K.G. Murty","year":"1992","unstructured":"Murty, K.G., Network Programming, Prentice-Hall, Englewood Cliffs, 1992"},{"key":"7_CR18","volume-title":"Electrical Engineering and Computer Science Department Ph.D. Thesis","author":"L.C. Polymenakos","year":"1995","unstructured":"Polymenakos, L.C. \u03b5-relaxation and auction algorithms for the convex cost network flow problem, Electrical Engineering and Computer Science Department Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, 1995"},{"key":"7_CR19","volume-title":"Department of Computer Science Report","author":"T. Radzik","year":"1995","unstructured":"Radzik, T., Faster algorithms for the generalized network flow problem, Department of Computer Science Report, King's College London, London, 1995"},{"key":"7_CR20","volume-title":"Network Flows and Monotropic Programming","author":"R.T. Rockafellar","year":"1984","unstructured":"Rockafellar, R.T., Network Flows and Monotropic Programming, Wiley-Interscience, New York, 1984"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01585734","volume":"46","author":"P. Tseng","year":"1990","unstructured":"Tseng, P., and Bertsekas, D.P., Relaxation methods for monotropic programs, Mathematical Programming 46 (1990) 127\u2013151","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:30:55Z","timestamp":1619573455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}