{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T21:23:10Z","timestamp":1773955390303,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971073"],"award-info":[{"award-number":["11971073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871115"],"award-info":[{"award-number":["11871115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671052"],"award-info":[{"award-number":["11671052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91630202"],"award-info":[{"award-number":["91630202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/tnet.2019.2955451","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T20:58:36Z","timestamp":1576616316000},"page":"224-233","source":"Crossref","is-referenced-by-count":9,"title":["Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8945-8613","authenticated-orcid":false,"given":"Caixia","family":"Kou","sequence":"first","affiliation":[]},{"given":"Dedong","family":"Hu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2277-1298","authenticated-orcid":false,"given":"Jianhua","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Wenbao","family":"Ai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"ref14","first-page":"142","article-title":"Search space reduction in QoS routing","author":"guo","year":"1999","journal-title":"Proc 19th IEEE Int Conf Distrib Comput Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref16","first-page":"157","article-title":"An approximation algorithm for combinatorial optimization problems with two parameters","volume":"14","author":"blokh","year":"1995","journal-title":"Australas J Combinatorics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/net.20247"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ATM.1998.675192"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref4","article-title":"The design and evaluation of routing algorithms for real-time channels","author":"widyono","year":"1994"},{"key":"ref3","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.21511"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48318-7_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.12.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"key":"ref22","first-page":"999","article-title":"ATM routing algorithms with multiple QOS requirements for multimedia internetworking","volume":"e79 b","author":"iwata","year":"1996","journal-title":"IEICE Trans Commun"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/net.20292"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.02.023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1995.502780"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45253-2_30"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015318600381"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8999818\/08935448.pdf?arnumber=8935448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T20:01:46Z","timestamp":1639771306000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8935448\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":26,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2955451","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}