{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:49:06Z","timestamp":1763016546499},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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,11]]},"DOI":"10.1007\/bf01299450","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:29:16Z","timestamp":1111724956000},"page":"229-259","source":"Crossref","is-referenced-by-count":12,"title":["A generic auction algorithm for the minimum cost network 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":"Lab. for Information and Decision Systems Working Paper","volume-title":"A distributed algorithm for the assignment problem","author":"D.P. Bertsekas","year":"1979","unstructured":"D.P. Bertsekas, ?A distributed algorithm for the assignment problem,? Lab. for Information and Decision Systems Working Paper, Massachusetts Inst. Technol., Cambridge, MA, 1979."},{"key":"CR2","series-title":"LIDS Report P-1606","volume-title":"Distributed asynchronous relaxation methods for linear network flow problems","author":"D.P. Bertsekas","year":"1986","unstructured":"D.P. Bertsekas, ?Distributed asynchronous relaxation methods for linear network flow problems,? LIDS Report P-1606, Massachusetts Inst. Technol., Cambridge, MA, 1986."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"D.P. Bertsekas, ?Distributed relaxation methods for linear network flow problems,? in Proc. 25th IEEE Conf. on Decision and Control, Athens, Greece, 1986, pp. 2101?2106.","DOI":"10.1109\/CDC.1986.267433"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas, ?The auction algorithm: a distributed relaxation method for the assignment problem,? Ann. Oper. Res., vol. 14, pp. 105?123, 1988.","journal-title":"Ann. Oper. Res."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0801026","volume":"1","author":"D.P. Bertsekas","year":"1991","unstructured":"D.P. Bertsekas, ?The auction algorithm for shortest paths,? SIAM J. on Optimization, vol. 1, pp. 425?447, 1991.","journal-title":"SIAM J. on Optimization"},{"key":"CR6","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":"CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00247653","volume":"1","author":"D.P. Bertsekas","year":"1992","unstructured":"D.P. Bertsekas, ?Auction algorithms for network flow problems: a tutorial introduction,? J. Comput. Optimization and Appl., vol. 1, pp. 7?66, 1992.","journal-title":"J. Comput. Optimization and Appl."},{"key":"CR8","series-title":"Laboratory for Information and Decision Systems Report LIDS-P-1925","volume-title":"The auction algorithm for the minimum cost network flow problem","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and D.A. Casta\u00f1on, ?The auction algorithm for the minimum cost network flow problem,? Laboratory for Information and Decision Systems Report LIDS-P-1925, Massachusetts Inst. Technol., Cambridge, MA, 1989"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02216923","volume":"20","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and D.A. Casta\u00f1on, ?The auction algorithm for transportation problems,? Ann. Oper. Res., vol. 20, pp. 67?96, 1989.","journal-title":"Ann. Oper. Res."},{"key":"CR10","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 Comput., vol. 17, pp. 707?732, 1991.","journal-title":"Parallel Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0803013","volume":"3","author":"D.P. Bertsekas","year":"1993","unstructured":"D.P. Bertsekas, D.A. Casta\u00f1on, and H. Tsaknakis, ?Reverse auction and the solution of inequality constrained assignment problems,? SIAM J. Optimization, vol. 3, pp. 268?297, 1993.","journal-title":"SIAM J. Optimization"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"D.P. Bertsekas and J. Eckstein, ?Distributed asynchronous relaxation methods for linear network flow problems,? in Proc. of IFAC '87, Munich, Germany, July 1987.","DOI":"10.1016\/S1474-6670(17)55135-6"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01589405","volume":"42","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas and J. Eckstein, ?Dual coordinate step methods for linear network flow problems,? Math. Progr., Series B, vol. 42, pp. 203?243, 1988.","journal-title":"Math. Progr., Series B"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02288322","volume":"13","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas and P. Tseng, ?RELAX: A computer code for minimum cost network flow problems,? Ann. Oper. Res., vol. 13, pp. 127?190, 1988.","journal-title":"Ann. Oper. Res."},{"key":"CR15","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":"CR16","doi-asserted-by":"crossref","unstructured":"D.A. Casta\u00f1on, ?Reverse auction algorithms for assignment problems,? in Network Flows and Matching, D.S. Johnson and C. McGeoch, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, American Mathematical Society, pp. 407?430, 1993.","DOI":"10.1090\/dimacs\/012\/16"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"S.E. Dreyfus, ?An appraisal of some shortest-path algorithms,? Oper. Res., vol. 17, pp. 395?412, 1969.","journal-title":"Oper. Res."},{"key":"CR18","series-title":"Tech. Report TR-374","volume-title":"Efficient graph algorithms for sequential and parallel computers","author":"A.V. Goldberg","year":"1987","unstructured":"A.V. Goldberg, ?Efficient graph algorithms for sequential and parallel computers,? Tech. Report TR-374, Laboratory for Computer Science, Massachusetts Inst. Technol.: Cambridge, MA, 1987."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"A.V. Goldberg","year":"1990","unstructured":"A.V. Goldberg and R. E. Tarjan, ?Solving minimum cost flow problems by successive approximation,? Math. Oper. Res., vol. 15, pp. 430?466, 1990.","journal-title":"Math. Oper. Res."},{"key":"CR20","volume-title":"Algorithms for Network Programming","author":"J. Kennington","year":"1980","unstructured":"J. Kennington and R. Helgason, Algorithms for Network Programming, Wiley: New York, 1980."},{"key":"CR21","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":"CR22","volume-title":"Data parallel solutions of min-cost network flow problems using ?-relaxations","author":"X. Li","year":"1991","unstructured":"X. Li and S.A. Zenios, ?Data parallel solutions of min-cost network flow problems using ?-relaxations,? Report 1991-05-20, Dept. of Decision Sciences, The Wharton School, Univ. of Pennsylvania, Philadelphia, 1991."},{"key":"CR23","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":"CR24","series-title":"Laboratory for Information and Decision Systems Report LIDS-P-2151","volume-title":"Parallel shortest path auction algorithm","author":"L.C. Polymenakos","year":"1993","unstructured":"L.C. Polymenakos and D.P. Bertsekas, ?Parallel shortest path auction algorithm,? Laboratory for Information and Decision Systems Report LIDS-P-2151, Masachusetts Inst. Techno, Cambridge, MA, 1993; Parallel Computing (to appear)."},{"key":"CR25","volume-title":"Network Flows and Monotropic Programming","author":"R.T. Rockafellar","year":"1984","unstructured":"R.T. Rockafellar, Network Flows and Monotropic Programming, Wiley-Interscience: New York, 1984."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299450.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299450\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:49:50Z","timestamp":1586180990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["BF01299450"],"URL":"https:\/\/doi.org\/10.1007\/bf01299450","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}