{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:15:20Z","timestamp":1725538520457},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037368"},{"type":"electronic","value":"9783642037375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03737-5_32","type":"book-chapter","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T16:27:02Z","timestamp":1254155222000},"page":"447-456","source":"Crossref","is-referenced-by-count":0,"title":["Determination the Basic Network Algorithms with Gains"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Bak\u00f3","sequence":"first","affiliation":[]},{"given":"P\u00e9ter","family":"F\u00f6ldesi","sequence":"additional","affiliation":[]},{"given":"Istv\u00e1n","family":"Sz\u0171ts","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/02331887308801108","volume":"4","author":"A. Bak\u00f3","year":"1973","unstructured":"Bak\u00f3, A.: On the Determination of the Shortest Path in a Network Having Gains. Operationsforschung und Statistik\u00a04, 63\u201368 (1973)","journal-title":"Operationsforschung und Statistik"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a Routing Problem. Quarterly of Appl. Math.\u00a016, 87\u201390 (1958)","journal-title":"Quarterly of Appl. Math."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1287\/opre.14.5.914","volume":"14","author":"A. Charnes","year":"1966","unstructured":"Charnes, A., Raike, W.M.: One-Pass Algorithms for Some Generalized Network Prblems. Operations Research\u00a014, 914\u2013923 (1966)","journal-title":"Operations Research"},{"key":"32_CR4","first-page":"1062","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, E.C., Rivert, R.L.: Introduction to Algorithms, p. 1062. MIT Press, Cambridge (2001)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: All Shortest Routes in a Graph, Operations Research House, Stanford University, TR 66-3 (1966)","DOI":"10.21236\/AD0646551"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S. Dreyfus","year":"1969","unstructured":"Dreyfus, S.: An Appraisal of Some Shortest Path Algorithms. Operations Research\u00a017, 395\u2013412 (1969)","journal-title":"Operations Research"},{"key":"32_CR7","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"32_CR8","unstructured":"Glover, F., Klingman, D., Napier, A.: A Note on Finding All Shortest Path, Management Science Report Series, Univ. of Colorado, Bulder, Colorado (1972)"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1287\/opre.16.1.91","volume":"16","author":"T.C. Hu","year":"1968","unstructured":"Hu, T.C.: A Decomposition Algorithm for Shortest Path in a Network. Operations Research\u00a016, 91\u2013102 (1968)","journal-title":"Operations Research"},{"key":"32_CR10","first-page":"678","volume":"19","author":"J.J. Jarvis","year":"1971","unstructured":"Jarvis, J.J., Jezior, A.M.: Maximal Flow with Gains through a Special Network. Perations Researc.\u00a019, 678\u2013688 (1971)","journal-title":"Perations Researc."},{"key":"32_CR11","doi-asserted-by":"publisher","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 Network with Gains. Operations Research\u00a010, 476\u2013499 (1962)","journal-title":"Operations Research"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A Theorem on Boolean Matrices. J. of ACM\u00a09, 11\u201312 (1962)","journal-title":"J. of ACM"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1287\/opre.19.4.983","volume":"19","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: On Hu\u2019s Decomposition Algorithm for Shortest Path in a Network. Operations Research\u00a019, 983\u2013985 (1971)","journal-title":"Operations Research"}],"container-title":["Studies in Computational Intelligence","Towards Intelligent Engineering and Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03737-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:35:30Z","timestamp":1606185330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03737-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037368","9783642037375"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03737-5_32","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}