{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:04Z","timestamp":1752378004247,"version":"3.41.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":[[2003,11]]},"DOI":"10.1023\/a:1025750631443","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T14:33:40Z","timestamp":1067006020000},"page":"191-208","source":"Crossref","is-referenced-by-count":8,"title":["Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept"],"prefix":"10.1007","volume":"26","author":[{"given":"Raffaele","family":"Cerulli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Festa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giancarlo","family":"Raiconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5143953_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications. Prentice-Hall: Englewood Cliffs, NJ, 1993."},{"key":"5143953_CR2","unstructured":"D. Bertsekas, \u201cA distributed algorithm for the assignment problem,\u201d Lab. for Information and Decision Systems Working Paper, MIT, March 1979."},{"key":"5143953_CR3","first-page":"1703","volume-title":"24th IEEE Conference on Decision and Control","author":"D. Bertsekas","year":"1985","unstructured":"D. Bertsekas, \u201cA distributed asynchronous relaxation algorithm for the assignment problem,\u201d in 24th IEEE Conference on Decision and Control, Ft Lauderdale, FL, pp. 1703-1704, 1985."},{"key":"5143953_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"D. Bertsekas","year":"1988","unstructured":"D. Bertsekas, \u201cThe auction algorithm: A distributed relaxation method for the assignment problems,\u201d Annals of Operation Research, vol. 14, pp. 105-123, 1988.","journal-title":"Annals of Operation Research"},{"key":"5143953_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0801026","volume":"1","author":"D. Bertsekas","year":"1991","unstructured":"D. Bertsekas, \u201cThe auction algorithm for shortest paths,\u201d SIAM J. on Optimization, vol. 1, pp. 425-447, 1991.","journal-title":"SIAM J. on Optimization"},{"key":"5143953_CR6","unstructured":"D. Bertsekas, Linear Networks Optimization: Algorithms and Codes. MIT Press, 1991."},{"key":"5143953_CR7","unstructured":"D. Bertsekas and D.A. Castanon, \u201cThe auction algorithm for minimum cost network flow problem,\u201d Lab. For Information and Decision Systems Report LIDS-P-1925, MIT, 1989."},{"key":"5143953_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02216923","volume":"20","author":"D. Bertsekas","year":"1989","unstructured":"D. Bertsekas and D.A. Castanon, \u201cThe auction algorithm for transportation problems,\u201d Annals of Operation Research, vol. 20, pp. 67-96, 1989.","journal-title":"Annals of Operation Research"},{"key":"5143953_CR9","unstructured":"D. Bertsekas and D.A. Castanon, \u201cA generic auction algorithm for the minimum cost network flow problem,\u201d Lab. for Information and Decision Systems Report LIDS-P-2084, MIT, 1991."},{"key":"5143953_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01302891","volume":"4","author":"D. Bertsekas","year":"1995","unstructured":"D. Bertsekas, S. Pallottino, and M.G. Scutell\u00e1, \u201cPolynomial auction algorithms for shortest paths,\u201d Computational Optimization and Application, vol. 4, pp. 99-125, 1995.","journal-title":"Computational Optimization and Application"},{"key":"5143953_CR11","doi-asserted-by":"crossref","unstructured":"R. Cerulli, R. De Leone, and G. Piacente, \u201cA modified auction algorithm for the shortest path problem,\u201d Optimization Methods and Software, vol. 4, 1994.","DOI":"10.1080\/10556789408805588"},{"key":"5143953_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011246118315","volume":"18","author":"R. Cerulli","year":"2001","unstructured":"R. Cerulli, P. Festa, and G. Raiconi \u201cGraph collapsing in auction algorithms,\u201d Tech. Report, D.I.A. R.M. Capocelli, University of Salerno, in Computational Optimization and Application, vol. 18, pp. 199-220, 2001.","journal-title":"Computational Optimization and Application"},{"key":"5143953_CR13","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"B.V. Cherkassky, A.V. Goldberg, and T. Radzik, \u201cShortest path algorithms: Theory and experimental evaluation,\u201d Math. Programm, vol. 73, pp. 129-174, 1996.","journal-title":"Math. Programm"},{"key":"5143953_CR14","doi-asserted-by":"crossref","unstructured":"E. Dijkstra, \u201cA note on two problems in connexion with graphs,\u201d Numerishe Mathematik, vol. 1, 1959.","DOI":"10.1007\/BF01386390"},{"key":"5143953_CR15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/BFb0121087","volume":"26","author":"G. Gallo","year":"1986","unstructured":"G. Gallo and S. Pallottino, \u201cShortest path methods: A unified approach,\u201d Math. Programming Study, vol. 26, pp. 38-64, 1986.","journal-title":"Math. Programming Study"},{"key":"5143953_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02288320","volume":"13","author":"G. Gallo","year":"1988","unstructured":"G. Gallo and S. Pallottino, \u201cShortest path methods,\u201d Ann. Oper. Res., vol. 13, pp. 3-79, 1988.","journal-title":"Ann. Oper. Res."},{"key":"5143953_CR17","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 generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems,\u201d Management Science, vol. 20, pp. 814-822, 1974.","journal-title":"Management Science"},{"key":"5143953_CR18","unstructured":"J. Larsen and I. Pedersen, \u201cExperiments with the auction algorithm for the shortest path problem,\u201d DIKU Technical Report 97\/6."},{"key":"5143953_CR19","unstructured":"G.F. Lugar and W.A. Stubblefield, Artificial Intelligence Structures and Strategies for Complex Problem Solving. Addison Wesley Longman, 1998."},{"key":"5143953_CR20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230140206","volume":"14","author":"S. Pallottino","year":"1984","unstructured":"S. Pallottino, \u201cShortest path methods: Complexity, interrelations and new propositions,\u201d Networks, vol. 14, pp. 257-267, 1984.","journal-title":"Networks"},{"key":"5143953_CR21","first-page":"60","volume":"21","author":"S. Pallottino","year":"1991","unstructured":"S. Pallottino and M.G. Scutell\u00e1, \u201cStrongly polynomial auction algorithms for shortest path,\u201d Ricerca Operativa, vol 21, p. 60, 1991.","journal-title":"Ricerca Operativa"},{"key":"5143953_CR22","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. Practice-Hall: Englewood Cliffs, NJ, 1982."},{"key":"5143953_CR23","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","volume":"7","author":"U. Pape","year":"1974","unstructured":"U. Pape, \u201cImplementation and efficiency of Moore-algorithms for the shortest path problem,\u201d Math. Programming, vol. 7, pp. 212-222, 1974.","journal-title":"Math. Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025750631443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025750631443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025750631443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:15:48Z","timestamp":1752376548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025750631443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["5143953"],"URL":"https:\/\/doi.org\/10.1023\/a:1025750631443","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}