{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:49:13Z","timestamp":1763016553699},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf01299544","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:56:56Z","timestamp":1111744616000},"page":"317-336","source":"Crossref","is-referenced-by-count":8,"title":["Parallel primal-dual methods for the minimum cost flow problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Dimitri P.","family":"Bertsekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Casta\ufffdon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0927-0507(89)01005-4","volume-title":"Network flows","author":"R. K. Ahuja","year":"1989","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, ?Network flows,? Handbooks in Operations Research and Management Science, vol. 1, Optimization, G. L. Nemhauser, A. H. G. Rinnooy-Kan, and M. J. Todd, (eds.), North-Holland: amsterdam, 1989, pp. 211?369."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1145\/115234.115349","volume":"34","author":"E. Balas","year":"1991","unstructured":"E. Balas, D. Miller, J. Pekny, and P. Toth, ?A parallel shortest part algorithm for the assign problem,? J. ACM, Vol. 34, pp. 985?1004, 1991.","journal-title":"J. ACM"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"D. P. Bertsekas, ?A unified framework for minimum cost network flow problems,? Math. Programming, pp. 125?145, 1985.","DOI":"10.1007\/BF01586087"},{"key":"CR4","volume-title":"Linear Network Optimization: Algorithms and Codes","author":"D. P. Bertsekas","year":"1991","unstructured":"D. P. Bertsekas, Linear Network Optimization: Algorithms and Codes, MIT Press: Cambridge, MA, 1991."},{"key":"CR5","unstructured":"D. P. Bertsekas, and D. A. Casta\u00f1on, ?Parallel asynchronous Hungarian methods for the assignment problem,? Alphatech Report, Feb. 1990, (to appear in ORSA J. of Comput)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0167-8191(05)80062-6","volume":"17","author":"D. P. Bertsekas","year":"1991","unstructured":"D. P. Bertsekas, and D. A. Casta\u00f1on, ?Parallel synchronous and asynchronous implementations of the auction algorithm,? Parallel Computing, vol. 17, pp. 707?732, 1991.","journal-title":"Parallel Computing"},{"key":"CR7","volume-title":"Lab. for Information and Decision Systems Report P-1606","author":"D. P. Bertsekas","year":"1991","unstructured":"D. P. Bertsekas, D. A. Casta\u00f1on, J. Eckstein, and S. Zenios, ?A survey of parallel algorithms for network optimization,? Lab. for Information and Decision Systems Report P-1606, Massachusetts Institute of Technology, November 1991; to appear in Handbooks in Operations Research and Management Science, vol. 4, North-Holland: Amsterdam."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.36.1.93","volume":"36","author":"D. P. Bertsekas","year":"1988","unstructured":"D. P. Bertsekas, and P. Tseng, ?Relaxation methods for minimum cost ordinary and generalized network flow problems,? Oper. Res. J., vol. 36, pp. 93?114, 1988.","journal-title":"Oper. Res. J."},{"key":"CR9","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: Englewood Cliffs, NJ, 1989."},{"key":"CR10","volume-title":"Portable Programs for Parallel Processors","author":"J. Boyle","year":"1987","unstructured":"J. Boyle, R. Butler, T. Disz, B. Glickfield, E. Lusk, R. Overbeek, J. Patterson, and R. Stevens, Portable Programs for Parallel Processors, Holt, Rinehart, and Winston: New York, NY, 1987."},{"key":"CR11","series-title":"O.R.O. Technical Report","volume-title":"A procedure for determining a family of minimal cost network flow patterns","author":"R. G. Busaker","year":"1961","unstructured":"R. G. Busaker, and P. J. Gowen, ?A procedure for determining a family of minimal cost network flow patterns? O.R.O. Technical Report No. 15, Operational Research Office, Johns Hopkins University, Baltimore, MD, 1961."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/nav.3800040109","volume":"4","author":"L. R. Ford Jr.","year":"1957","unstructured":"L. R. Ford, Jr. and D. R. Fulkerson, ?A primal-dual algorithm for the capacitated Hitchcock problem,? Naval Res. Log. Q. vol. 4, pp. 47?54, 1957.","journal-title":"Naval Res. Log. Q."},{"key":"CR13","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press: Princeton, NJ, 1962."},{"key":"CR14","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, ?NETGEN ? A program for generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems,? Mgmt. Sci., vol. 20, pp. 814?822, 1974.","journal-title":"Mgmt. Sci."},{"key":"CR15","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou, and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall: Englewood Cliffs, NJ, 1982."},{"key":"CR16","volume-title":"Network Flows and Monotropic Programming","author":"R. T. Rockafellar","year":"1984","unstructured":"R. T. Rockafellar, Network Flows and Monotropic Programming, Wiley-Interscience: NY, New York, 1984."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299544.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299544\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:58:37Z","timestamp":1586181517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01299544"],"URL":"https:\/\/doi.org\/10.1007\/bf01299544","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}