{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:54:07Z","timestamp":1752461647585,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":[[2001,3]]},"DOI":"10.1023\/a:1011246118315","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T04:18:21Z","timestamp":1040617101000},"page":"199-220","source":"Crossref","is-referenced-by-count":5,"title":["Graph Collapsing in Shortest Path Auction Algorithms"],"prefix":"10.1007","volume":"18","author":[{"given":"R.","family":"Cerulli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Festa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Raiconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"321080_CR1","unstructured":"D. Bertsekas, \u201cA distributed algorithm for the assignment problem, \u201d Lab. for Information and Decision Systems, Working Paper, MIT, March 1979."},{"key":"321080_CR2","doi-asserted-by":"crossref","unstructured":"D. Bertsekas, \u201cA distributed asynchronous relaxation algorithm for the assignment problem, \u201d in 24th IEEE Conference on Decision and Control, Ft Lauderdale, Fla., 1985, pp. 1703\u20131704.","DOI":"10.1109\/CDC.1985.268826"},{"key":"321080_CR3","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\u2013123, 1988.","journal-title":"Annals of Operation Research"},{"key":"321080_CR4","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":"321080_CR5","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\u201396, 1989.","journal-title":"Annals of Operation Research"},{"key":"321080_CR6","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":"321080_CR7","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\u2013447, 1991.","journal-title":"SIAM J. on Optimization"},{"key":"321080_CR8","unstructured":"D. Bertsekas, Linear Networks Optimization: Algorithms and Codes, MIT Press, 1991."},{"key":"321080_CR9","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\u2013125, 1995.","journal-title":"Computational Optimization and Application"},{"key":"321080_CR10","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":"321080_CR11","first-page":"129","volume":"73","author":"B.V. Chernassky","year":"1996","unstructured":"B.V. Chernassky, A.V. Goldberg, and T. Radzik, \u201cShortest path algorithms: Theory and experimental evaluation, \u201d Math. Programm. vol. 73, pp. 129\u2013174, 1996.","journal-title":"Math. Programm."},{"key":"321080_CR12","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":"321080_CR13","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\u201364, 1986.","journal-title":"Math. Programming Study"},{"key":"321080_CR14","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\u201379, 1988.","journal-title":"Ann. Oper. Res."},{"key":"321080_CR15","unstructured":"G. Gallo, S. Pallottino, C. Ruggeri, and G. Storchi, Metodi ed algoritmi per la determinazione di cammini minimi, Monografie di Software Matematico n. 29, 1984."},{"key":"321080_CR16","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\u2013822, 1974.","journal-title":"Management Science"},{"key":"321080_CR17","unstructured":"J. Larsen and I. Pedersen, \u201cExperiments with the auction algorithm for the shortest path problem, \u201d DIKU Technical Report 97\/6."},{"key":"321080_CR18","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":"321080_CR19","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: Eaglewood Cliffs, N.J., 1982."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011246118315.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011246118315\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011246118315.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:30:54Z","timestamp":1752377454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011246118315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["321080"],"URL":"https:\/\/doi.org\/10.1023\/a:1011246118315","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}