{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:05:16Z","timestamp":1747652716315},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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,6]]},"DOI":"10.1007\/bf01299142","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:57:33Z","timestamp":1111744653000},"page":"47-75","source":"Crossref","is-referenced-by-count":24,"title":["The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm"],"prefix":"10.1007","volume":"2","author":[{"given":"Richard V.","family":"Helgason","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffery L.","family":"Kennington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Douglas","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Programming, Games, and Transportation Networks","author":"C. Berge","year":"1962","unstructured":"C. Berge and A. Ghouila-Houri,Programming, Games, and Transportation Networks, John Wiley and Sons, Inc., New York, NY, 1962."},{"key":"CR2","volume-title":"Data Networks","author":"D. Bertsekas","year":"1987","unstructured":"D. Bertsekas and R. Gallager,Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1987."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/mnsc.6.2.187","volume":"6","author":"G. Dantzig","year":"1960","unstructured":"G. Dantzig, ?On the shortest route through a network,?Mgmt. Sci. 6 (1960) 187?190.","journal-title":"Mgmt. Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N. Deo","year":"1984","unstructured":"N. Deo and C. Pang, ?Shortest-path algorithms: Taxonomy and annotation,?Networks 14 (1984) 275?323.","journal-title":"Networks"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-6377(87)90017-4","volume":"6","author":"M. Desrochers","year":"1987","unstructured":"M. Desrochers, ?A note on the partitioning shortest path algorithm,?Oper. Res. Letters 6 (1987) 183?187.","journal-title":"Oper. Res. Letters"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R. Dial","year":"1969","unstructured":"R. Dial, ?Algorithm 360: Shortest path forest with topological ordering,?Commun. ACM,12 (1969) 632?633.","journal-title":"Commun. ACM"},{"key":"CR7","series-title":"CCS Report","volume-title":"A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees","author":"R. Dial","year":"1977","unstructured":"R. Dial, F. Glover, D. Karney, and D. Klingman,A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees, CCS Report 291, Center for Cybernetic Studies, The University of Texas, Austin, TX 1977."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230090304","volume":"9","author":"R. Dial","year":"1979","unstructured":"R. Dial, F. Glover, D. Karney, and D. Klingman, ?A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees,?Networks 9 (1979) 215?250.","journal-title":"Networks"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra, ?A note on two problems in connexion with graphs,?Numerische Mathematik 1 (1959) 269?271.","journal-title":"Numerische Mathematik"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0167-6377(87)90053-8","volume":"6","author":"J. Divoky","year":"1987","unstructured":"J. Divoky, ?Improvements for the Thresh X2 shortest path algorithm,?Oper. Res. Letters 6 (1987) 227?232.","journal-title":"Oper. Res. Letters"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S. Dreyfus","year":"1969","unstructured":"S. Dreyfus, ?An appraisal of some shortest-path algorithms,?Oper. Res. 17 (1969) 395?412.","journal-title":"Oper. Res."},{"key":"CR12","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even,Graph Algorithms, Computer Science Press, Rockville, MD, 1979."},{"key":"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, ?Shortest path methods: A unifying approach,?Math. Programming Study 26 (1986) 38?64.","journal-title":"Math. Programming Study"},{"key":"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, ?Shortest path algorithms,?Ann. Oper. Res. 13 (1988) 3?79.","journal-title":"Ann. Oper. Res."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230140103","volume":"14","author":"F. Glover","year":"1984","unstructured":"F. Glover, R. Glover, and D. Klingman, ?Computational study of an improved shortest path algorithm,?Networks 14 (1984) 25?36.","journal-title":"Networks"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1287\/mnsc.31.9.1106","volume":"31","author":"F. Glover","year":"1985","unstructured":"F. Glover, D. Klingman, N. Phillips, and R. Schneider, ?New Polynomial Shortest Path Algorithms and Their Computational Attributes,?Mgmt. Sci. 31 (1985) 1106?1128.","journal-title":"Mgmt. Sci."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"P. Hart, N. Nilsson, and B. Raphael, ?A formal basis for the heuristic determination of minimum cost paths,?IEEE Trans. of Systems Science and Cybernetics,SSC-4 (1968) 100?107.","journal-title":"IEEE Trans. of Systems Science and Cybernetics, SSC"},{"key":"CR18","volume-title":"Combinatorial Algorithms","author":"T. Hu","year":"1982","unstructured":"T. Hu,Combinatorial Algorithms, Addison-Wesley, Reading, MA, (1982)."},{"key":"CR19","volume-title":"Network Flow Programming","author":"P. Jensen","year":"1980","unstructured":"P. Jensen and J. Barnes,Network Flow Programming, John Wiley and Sons, Inc., New York, NY, 1980."},{"key":"CR20","series-title":"CCS Report","volume-title":"Improving Flow Management and Control Via Improving Shortest Path Analysis","author":"D. Klingman","year":"1978","unstructured":"D. Klingman, J. Mote, and D. Whitman,Improving Flow Management and Control Via Improving Shortest Path Analysis, CCS Report 322, Center for Cybernetic Studies, The University of Texas, Austin, TX, 1978."},{"key":"CR21","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1987","unstructured":"E. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York, NY, 1987."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02276912","volume":"40","author":"T. Mohr","year":"1988","unstructured":"T. Mohr and C. Pasche, ?A parallel shortest path algorithm,?Computing 40 (1988) 281?292.","journal-title":"Computing"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1093\/comjnl\/9.3.275","volume":"9","author":"T. Nicholson","year":"1966","unstructured":"T. Nicholson, ?Finding the Shortest Route Between Two Points in a Network,?The Computer J. 9 (1966) 275?280.","journal-title":"The Computer J."},{"key":"CR24","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. Papadimitriou","year":"1987","unstructured":"C. Papadimitriou, and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1987."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"I. Pohl,Bi-directional and Heuristic Search in Path Problems, SLAC Report No. 104, Stanford, CA, 1969.","DOI":"10.2172\/4785039"},{"key":"CR26","first-page":"127","volume":"6","author":"I. Pohl","year":"1971","unstructured":"I. Pohl, ?Bi-directional Search,?Machine Intelligence, B. Meltzer and D. Michie, eds.,6 (1971) 127?140.","journal-title":"Machine Intelligence"},{"key":"CR27","volume-title":"Designing Efficient Algorithms for Parallel Computers","author":"M. Quinn","year":"1984","unstructured":"M. Quinn,Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, New York, NY, 1984."},{"key":"CR28","volume-title":"Network flows and monotropic optimization","author":"R. Rockafellar","year":"1984","unstructured":"R. Rockafellar,Network flows and monotropic optimization, John Wiley and Sons, Inc., New York, NY, 1984."},{"key":"CR29","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. Tarjan","year":"1983","unstructured":"R. Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299142.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299142\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:58:38Z","timestamp":1586181518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01299142"],"URL":"https:\/\/doi.org\/10.1007\/bf01299142","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}