{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:06:43Z","timestamp":1761293203094},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"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. Comput."],"published-print":{"date-parts":[[2015,9,1]]},"DOI":"10.1109\/tc.2014.2366762","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T19:32:11Z","timestamp":1415043131000},"page":"2559-2572","source":"Crossref","is-referenced-by-count":14,"title":["Finding Multi-Constrained Multiple Shortest Paths"],"prefix":"10.1109","volume":"64","author":[{"given":"Gang","family":"Feng","sequence":"first","affiliation":[]},{"given":"Turgay","family":"Korkmaz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.04.002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2975573"},{"key":"ref30","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref37","year":"0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00209-7"},{"key":"ref35","year":"0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TNET.2004.836112","article-title":"Concepts of exact quality of service algorithms","volume":"12","author":"mieghem","year":"2004","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref11","first-page":"743","article-title":"A*prune: An algorithm for finding K shortest paths subject to multiple constraints","author":"liu","year":"0","journal-title":"Proc IEEE Conf Comput Commun"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref13","first-page":"123","article-title":"Fast exact multiconstrained shortest path algorithms","author":"li","year":"0","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained shortest path problem","volume":"10","author":"y","year":"1980","journal-title":"Networks"},{"key":"ref15","article-title":"Constrained shortest paths and related problems","author":"ziegelmann","year":"2001"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the $K$ shortest loopless paths in a network","volume":"17","author":"y","year":"1971","journal-title":"Manage Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.12.015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130212"},{"key":"ref28","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.136"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.12.001"},{"key":"ref29","author":"schrijver","year":"1986","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.21511"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900712"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852882"},{"key":"ref1","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref20","first-page":"191","article-title":"A generalized permanent labeling algorithm for the shortest path problem with time windows","volume":"26","author":"desrochers","year":"1988","journal-title":"Inf Syst Oper Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199303)40:2<143::AID-NAV3220400202>3.0.CO;2-6"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/net.20247","article-title":"Lagrangian relaxation and enumeration for solving constrained shortest-path problems","volume":"52","author":"m","year":"2008","journal-title":"Networks"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/TASE.2009.2012434","article-title":"K constrained shortest path problem","volume":"7","author":"shi","year":"2010","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-008-0074-8"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7180479\/06945373.pdf?arnumber=6945373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:41:31Z","timestamp":1642005691000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6945373\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":37,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2366762","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9,1]]}}}