{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T11:12:10Z","timestamp":1718709130262},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,6]],"date-time":"2013-01-06T00:00:00Z","timestamp":1357430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s13198-012-0140-7","type":"journal-article","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T23:52:43Z","timestamp":1357343563000},"page":"13-18","source":"Crossref","is-referenced-by-count":4,"title":["A minimum weight labelling method for determination of a shortest route in a non-directed network"],"prefix":"10.1007","volume":"4","author":[{"given":"Santosh","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Elias","family":"Munapo","sequence":"additional","affiliation":[]},{"given":"Ozias","family":"Ncube","sequence":"additional","affiliation":[]},{"given":"Caston","family":"Sigauke","sequence":"additional","affiliation":[]},{"given":"Philimon","family":"Nyamugure","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,6]]},"reference":[{"issue":"2","key":"140_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/TR.1977.5220064","volume":"R-26","author":"SP Banasal","year":"1977","unstructured":"Banasal SP, Kumar S (1977) Maximum reliability route subject to M improvements in a directed graph. IEEE Trans Reliab R-26(2):103\u2013105","journal-title":"IEEE Trans Reliab"},{"issue":"2","key":"140_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/mnsc.6.2.187","volume":"6","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB (1960) On the shortest route through a network. Manag Sci 6(2):187\u2013190","journal-title":"Manag Sci"},{"key":"140_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"issue":"6","key":"140_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"140_CR5","unstructured":"Ford LR (1956) Network flow theory, Report P\u2013923, The Rand Corporation"},{"issue":"1","key":"140_CR6","first-page":"3","volume":"26","author":"S Kumar","year":"1999","unstructured":"Kumar S, Arora H, Bappoo R (1999) Kth best solution of a system. J Appl Cybern SCIMA 26(1):3\u201319","journal-title":"J Appl Cybern SCIMA"},{"issue":"1","key":"140_CR7","first-page":"81","volume":"21","author":"E Munapo","year":"2010","unstructured":"Munapo E (2010) Project activity analysis without the network model. S Afr J Ind Eng 21(1):81\u201392","journal-title":"S Afr J Ind Eng"},{"issue":"1","key":"140_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.5784\/24-1-58","volume":"24","author":"E Munapo","year":"2008","unstructured":"Munapo E, Jones BC, Kumar S (2008) Minimum incoming weight label method and its application in CPM networks. ORiON 24(1):37\u201348","journal-title":"ORiON"},{"issue":"1","key":"140_CR9","first-page":"69","volume":"1","author":"FB Zhan","year":"1997","unstructured":"Zhan FB (1997) Three shortest path algorithms on real road networks: data structures and procedures. J Geogr Inf Decis Anal 1(1):69\u201382","journal-title":"J Geogr Inf Decis Anal"},{"issue":"1","key":"140_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/trsc.32.1.65","volume":"32","author":"FB Zhan","year":"1998","unstructured":"Zhan FB, Noon CE (1998) Shortest path algorithms: an evaluation using real road networks. Transp Sci 32(1):65\u201373","journal-title":"Transp Sci"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-012-0140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13198-012-0140-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-012-0140-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:48:42Z","timestamp":1559472522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13198-012-0140-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,6]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s13198-012-0140-7","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"value":"0975-6809","type":"print"},{"value":"0976-4348","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,6]]}}}