{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:32:20Z","timestamp":1761597140594},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1109\/tase.2009.2012434","type":"journal-article","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T17:59:52Z","timestamp":1242064792000},"page":"15-23","source":"Crossref","is-referenced-by-count":17,"title":["$K$ Constrained Shortest Path Problem"],"prefix":"10.1109","volume":"7","author":[{"family":"Ning Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","article-title":"computing the <formula formulatype=\"inline\"> <tex notation=\"tex\">${\\rm k}$<\/tex><\/formula> shortest paths: a new algorithm and an experimental comparison","volume":"1668","author":"jimenez","year":"1999","journal-title":"Lecture Notes in Comput Sci"},{"key":"ref11","first-page":"743","article-title":"a <formula formulatype=\"inline\"> <tex notation=\"tex\">$^{\\ast}$<\/tex><\/formula> prune: an algorithm for finding <formula formulatype=\"inline\"><tex notation=\"tex\">$k$<\/tex><\/formula> shortest paths subject to multiple constraints","author":"liu","year":"2001","journal-title":"Proc IEEE InfoCom"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000186"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-002-0010-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2005.05.005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2004.07.004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/net.10073"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0111081"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref5","first-page":"951","article-title":"improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path algorithm","volume":"44","author":"dumitrescu","year":"2003","journal-title":"Networks"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1","article-title":"an efficient implementation of an algorithm for finding <formula formulatype=\"inline\"><tex notation=\"tex\">$k$<\/tex> <\/formula> shortest simple paths","volume":"34","author":"hadjiconstantinous","year":"1999","journal-title":"Networks"},{"key":"ref2","first-page":"307","article-title":"multidimensional path search and assignment","author":"barra","year":"1993","journal-title":"Proc 19th PTRC Summer Annual Meeting"},{"key":"ref1","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.3.423.11217"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8856\/5361440\/04912443.pdf?arnumber=4912443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:19Z","timestamp":1633910359000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4912443\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":16,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tase.2009.2012434","relation":{},"ISSN":["1545-5955"],"issn-type":[{"value":"1545-5955","type":"print"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}