{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T09:30:41Z","timestamp":1783416641799,"version":"3.54.6"},"reference-count":62,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5844,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1002\/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T19:39:36Z","timestamp":1100461176000},"page":"88-101","source":"Crossref","is-referenced-by-count":50,"title":["An efficient implementation of an algorithm for findingK shortest simple paths"],"prefix":"10.1002","volume":"34","author":[{"given":"E.","family":"Hadjiconstantinou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"N.","family":"Christofides","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB1","volume-title":"Data structures and algorithms","author":"Aho","year":"1983","unstructured":"and Data structures and algorithms, Addison-Wesley, Reading, MA, 1983."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"Ahua","year":"1990","journal-title":"J Assoc Comput Mach"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"Azevedo","year":"1993","journal-title":"Eur J Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB4","first-page":"582","volume":"8","author":"Bellman","year":"1960","journal-title":"J SIAM"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/net.3230230808","volume":"23","author":"Bertsekas","year":"1993","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB6","first-page":"177","volume-title":"A binary enumeration tree to find K shortest paths","author":"Carraresi","year":"1983","unstructured":"and A binary enumeration tree to find K shortest paths. 7th Symp Operations Res, Methods of Operations Research, 1983, pp. 177-188."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(94)90045-0","volume":"21","author":"Chen","year":"1994","journal-title":"Comput Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0305-0548(93)90096-2","volume":"20","author":"Chen","year":"1993","journal-title":"Comput Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","volume":"50","author":"Chen","year":"1994","journal-title":"Info Process Lett"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB10","first-page":"1096","volume":"11","author":"Clarke","year":"1963","journal-title":"J SIAM"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"Deo","year":"1984","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Num Math"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB14","author":"Eppstein","year":"1994","unstructured":"Finding the K shortest paths. Proc 35th IEEE Symp Foundations of Computer Science (FOCS'94), 1994, pp. 154-165."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB15","first-page":"66","volume":"11","author":"Fox","year":"1973","journal-title":"INFOR-Can J Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB16","first-page":"b263","volume":"23","author":"Fox","year":"1975","journal-title":"ORSA\/TIMS Nat Mtg Bull Oper Res Soc Am"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB17","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.26.5.686","volume":"26","author":"Fox","year":"1978","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB18","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"Fredman","year":"1987","journal-title":"J Assoc Comput Mach"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB19","author":"Fredman","year":"1990","unstructured":"and Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Proc. 31st IEEE Symp Foundations of Computer Science (FOCS'90), 1990, pp. 719-725."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02288320","volume":"13","author":"Gallo","year":"1988","journal-title":"Ann Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB21","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1287\/opre.37.4.542","volume":"37","author":"Glover","year":"1989","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.33.1.65","volume":"33","author":"Glover","year":"1985","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB23","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/opre.38.4.624","volume":"38","author":"Goldfarb","year":"1990","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB24","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230210105","volume":"21","author":"Goldfarb","year":"1991","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB25","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","volume":"61","author":"Hadjiconstantinou","year":"1995","journal-title":"Ann Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB26","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/320998.321004","volume":"6","author":"Hoffman","year":"1959","journal-title":"J Assoc Commun Mach"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB27","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1980.79","volume":"31","author":"Horne","year":"1980","journal-title":"J Oper Res Soc"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB28","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0305-0548(88)90052-4","volume":"15","author":"Hung","year":"1988","journal-title":"Comput Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB29","author":"Jin","year":"1989","unstructured":"and An electrical method for finding suboptimal routes, Proc IEEE Int Symp Circuits and Systems, Vol. 2, 1989, pp. 935-938."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"Johnson","year":"1977","journal-title":"J Assoc Comput Mach"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB31","first-page":"971","volume":"61","author":"Katoh","year":"1978","journal-title":"Trans Inst Elect Commun Eng Jpn E"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB32","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"Katoh","year":"1982","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB33","first-page":"21","volume":"24","author":"Kumar","year":"1994","journal-title":"Comput Sci Info"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB34","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"Lawler","year":"1972","journal-title":"Management Sci"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB35","first-page":"603","volume":"20","author":"Lawler","year":"1977","journal-title":"Commun Assoc Comput Mach"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB36","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","volume":"18","author":"Martins","year":"1984","journal-title":"European J Operational Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB37","volume-title":"A new shortest paths ranking algorithm","author":"Martins","year":"1996","unstructured":"and A new shortest paths ranking algorithm, University of Coimbra, Portugal, (1996)."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB38","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(91)90093-B","volume":"53","author":"Miaou","year":"1991","journal-title":"European J Operational Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB39","first-page":"351","volume":"17","author":"Minieka","year":"1974","journal-title":"Commun Assoc Comput Mach"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB40","first-page":"b","volume":"23","author":"Minieka","year":"1975","journal-title":"Bull Operations Res Soc America"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB41","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1093\/imamat\/11.2.145","volume":"11","author":"Minieka","year":"1973","journal-title":"J Inst Math Appl"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB42","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/0305-0548(91)90014-I","volume":"18","author":"Mondou","year":"1991","journal-title":"Comput Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB43","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/355900.355919","volume":"6","author":"Pape","year":"1980","journal-title":"Assoc Comput Mach Trans Math Software"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB44","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/net.3230160204","volume":"16","author":"Perko","year":"1986","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB45","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"Rosen","year":"1991","journal-title":"Comput Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB46","author":"Ruppert","year":"1997","unstructured":"Finding the K shortest paths in parallel, Proc 14th Symp Theoretical Aspects of Computer Science (STACS'97), 1997, pp. 475-485."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB47","doi-asserted-by":"crossref","first-page":"139","DOI":"10.6028\/jres.078B.020","volume":"78","author":"Shier","year":"1974","journal-title":"J Res Natl Bur Stand Sect B"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB48","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230060303","volume":"6","author":"Shier","year":"1976","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB49","first-page":"115","author":"Shier","year":"1976","journal-title":"ORSA\/TIMS Joint Nat Mtg TIMS\/ORSA Bull"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB50","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230090303","volume":"9","author":"Shier","year":"1979","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB51","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/net.3230170308","volume":"17","author":"Skicsim","year":"1987","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB52","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02216932","volume":"20","author":"Skicsim","year":"1989","journal-title":"Ann Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB53","first-page":"356","volume":"26","author":"Sugimoto","year":"1985","journal-title":"Trans Info Process Soc Jpn."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB54","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"Suurballe","year":"1974","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB55","author":"Thorup","year":"1997","unstructured":"Undirected single source shortest paths in linear time, Proc 38th IEEE Symp Foundations of Computer Science (FOCS'97), 1997, pp. 12-21."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB56","first-page":"523","author":"Tomizawa","year":"1976","journal-title":"Trans Inst Elect Commun Eng Jpn J59-A"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB57","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0041-1647(78)90102-8","volume":"12","author":"Van Vliet","year":"1978","journal-title":"Trans Res"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB58","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02241985","volume":"16","author":"Weigand","year":"1976","journal-title":"Computing"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB59","author":"Weston","year":"1995","unstructured":"Costing telecommunications services, PhD Thesis, Centre for Quantitative Finance, Imperial College, 1995."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB60","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230060403","volume":"6","author":"Wongseelashote","year":"1976","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB61","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"Yen","year":"1971","journal-title":"Mgmt Sci"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1-BIB62","first-page":"b","volume":"20","author":"Yen","year":"1972","journal-title":"Bull Oper Res Soc of Am"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(199909)34:2%3C88::AID-NET2%3E3.0.CO;2-1","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(199909)34:2%3C88::AID-NET2%3E3.0.CO;2-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T09:31:52Z","timestamp":1625131912000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,9]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}