{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T06:32:48Z","timestamp":1792996368171,"version":"4.5.0"},"reference-count":35,"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-03T14:32:11Z","timestamp":1415025131000},"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":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Turgay","family":"Korkmaz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref2","first-page":"859","article-title":"Lagrange relaxation based method for\n the QoS routing problem","volume-title":"Proc. IEEE Conf. Comput. Commun.","author":"Jttner","year":"2001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.21511"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.12.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900712"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852882"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2004.836112"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2001.916263"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref13","first-page":"123","article-title":"Fast exact multiconstrained\n shortest path algorithms","volume-title":"Proc. IEEE Int. Conf. Commun.","author":"Li","year":"2006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref15","article-title":"Constrained shortest paths and related problems","author":"Ziegelmann","year":"2001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"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":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1988.11732063"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.20247"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199303)40:2<143::AID-NAV3220400202>3.0.CO;2-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-008-0074-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2009.2012434"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.136"},{"key":"ref28","volume-title":"Network\n Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"ref29","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"ref30","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2975573"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.04.002"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00209-7"}],"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":[[2026,10,26]],"date-time":"2026-10-26T05:33:47Z","timestamp":1792992827000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6945373\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":35,"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]]}}}