{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:12:38Z","timestamp":1771035158185,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1981,1]]},"DOI":"10.1016\/0305-0548(81)90015-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"275-293","source":"Crossref","is-referenced-by-count":14,"title":["A computational study of Floyd's algorithm"],"prefix":"10.1016","volume":"8","author":[{"given":"Douglas R.","family":"Shier","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(81)90015-0_BIB1","year":"1966"},{"key":"10.1016\/0305-0548(81)90015-0_BIB2","year":"1978"},{"key":"10.1016\/0305-0548(81)90015-0_BIB3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","article-title":"An algebra for network routing problems","volume":"7","author":"Carr\u00e9","year":"1971","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0305-0548(81)90015-0_BIB4","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1115\/1.3438296","article-title":"A comparison of numerical optimization methods for engineering design","volume":"96","author":"Eason","year":"1974","journal-title":"J. Engng Ind. Ser. B"},{"key":"10.1016\/0305-0548(81)90015-0_BIB5","article-title":"PROFILE: An automated aid to program analysis","author":"Ferguson","year":"1978"},{"key":"10.1016\/0305-0548(81)90015-0_BIB6","series-title":"Proc. 9th Interface Symp. Computer Science and Statistics","first-page":"212","article-title":"DATAPAC: A data analysis package","author":"Filliben","year":"1976"},{"key":"10.1016\/0305-0548(81)90015-0_BIB7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0305-0548(81)90015-0_BIB8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1216456.1216458","article-title":"Timing on computers","volume":"2","author":"Gentleman","year":"1973","journal-title":"SIGARCH"},{"key":"10.1016\/0305-0548(81)90015-0_BIB9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/03610917708812053","article-title":"Methodology and analysis for comparing discrete linear Lt approximation codes","volume":"B6","author":"Gilsinn","year":"1977","journal-title":"Commun. Statist."},{"key":"10.1016\/0305-0548(81)90015-0_BIB10","doi-asserted-by":"crossref","DOI":"10.6028\/NBS.TN.772","article-title":"A performance comparison of labeling algorithms for calculating shortest path trees","author":"Gilsinn","year":"1973"},{"key":"10.1016\/0305-0548(81)90015-0_BIB11","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1287\/opre.24.6.1164","article-title":"Shortest-path algorithms: a comparison","volume":"24","author":"Golden","year":"1976","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(81)90015-0_BIB12","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/opre.27.3.534","article-title":"On the storage and handling of binary data using FORTRAN with applications to integer programming","volume":"27","author":"Graves","year":"1979","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(81)90015-0_BIB13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/355759.355760","article-title":"A simulation test approach to the evaluation of nonlinear optimization algorithms","volume":"3","author":"Hillstrom","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0305-0548(81)90015-0_BIB14","article-title":"A comparative investigation of the computational efficiency of shortest path algorithms","author":"Hitchner","year":"1968"},{"key":"10.1016\/0305-0548(81)90015-0_BIB15","article-title":"A comparison of shortest path algorithms applied to sparse graphs","author":"Hulme","year":"1978"},{"key":"10.1016\/0305-0548(81)90015-0_BIB16","first-page":"230","article-title":"Program Style, Design, Efficiency, Debugging, and Testing","author":"Ingalls","year":"1974"},{"key":"10.1016\/0305-0548(81)90015-0_BIB17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230080203","article-title":"A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths","volume":"8","author":"Kelton","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0305-0548(81)90015-0_BIB18","article-title":"Improving flow management and control via improving shortest path analysis","author":"Klingman","year":"1978"},{"key":"10.1016\/0305-0548(81)90015-0_BIB19","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0305-0548(81)90015-0_BIB20","first-page":"647","article-title":"Asupra unor reprezent\u01ceri aie grafurilor ce intervin in probleme de economia transporturilor","volume":"10","author":"Moisil","year":"1960","journal-title":"Com. Acad. R. P. Romine"},{"key":"10.1016\/0305-0548(81)90015-0_BIB21","article-title":"A new method for finding all elementary paths in a complete directed graph","author":"Murchland","year":"1965"},{"key":"10.1016\/0305-0548(81)90015-0_BIB22","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","article-title":"Implementation and efficiency of Moore-algorithms for the shortest route problem","volume":"7","author":"Pape","year":"1974","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(81)90015-0_BIB23","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/355626.355633","article-title":"The influence of the compiler on the cost of mathematical software\u2014in particular on the cost of triangular factorization","volume":"1","author":"Parlett","year":"1975","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0305-0548(81)90015-0_BIB24","article-title":"On some experiments which delimit the utility of nonlinear programming algorithms","author":"Ragsdell","year":"1978"},{"key":"10.1016\/0305-0548(81)90015-0_BIB25","series-title":"SPY and PROFIL: DEC-10 program measurement tools","author":"Ripley","year":"1974"},{"key":"10.1016\/0305-0548(81)90015-0_BIB26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1051\/m2an\/196802R100711","article-title":"G\u00e9n\u00e9ralisation de l'algorithme de Warshall","volume":"2","author":"Robert","year":"1968","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"10.1016\/0305-0548(81)90015-0_BIB27","first-page":"216","article-title":"Transitivit\u00e9 et connexit\u00e9","volume":"249","author":"Roy","year":"1959","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0305-0548(81)90015-0_BIB28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1051\/m2an\/196802R100871","article-title":"Sur l'algorithme matriciel de B. Roy","volume":"2","author":"Tomescu","year":"1968","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"10.1016\/0305-0548(81)90015-0_BIB29","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on Boolean matrices","volume":"9","author":"Warshall","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(81)90015-0_BIB30","doi-asserted-by":"crossref","first-page":"552","DOI":"10.2307\/2311149","article-title":"A note on a generalization of Boolean matrix theory","volume":"68","author":"Yoeli","year":"1961","journal-title":"Am. Math. Monthly"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054881900150?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054881900150?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:28:43Z","timestamp":1552912123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054881900150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0305054881900150"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(81)90015-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}