{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:37:57Z","timestamp":1725601077922},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232251"},{"type":"electronic","value":"9783642232268"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23226-8_77","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:37:59Z","timestamp":1313584679000},"page":"598-604","source":"Crossref","is-referenced-by-count":0,"title":["A Shortest Path Algorithm with Constraints in Networks"],"prefix":"10.1007","author":[{"given":"Fanguo","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuobin","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"77_CR1","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1109\/26.2815","volume":"36","author":"D.M. Topkis","year":"1988","unstructured":"Topkis, D.M.: A k Shortest Path Algorithm for Adaptive Routing in Communications Networks. IEEE Transactions on communications\u00a036(1), 855\u2013859 (1988)","journal-title":"IEEE Transactions on communications"},{"key":"77_CR2","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.trb.2006.12.001","volume":"41","author":"L. Santos","year":"2007","unstructured":"Santos, L., et al.: An improved solution algorithm for the constrained shortest path problem. Transportation Research Part B\u00a041, 756\u2013771 (2007)","journal-title":"Transportation Research Part B"},{"key":"77_CR3","unstructured":"Li, Y.: On the models and algorithms for finding dissimilar shortest paths in a traffic network. In: The 7th National Operation Research Conference of China, Qingdao, China, p. 8 (2004)"},{"key":"77_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.S. Garey","year":"1979","unstructured":"Garey, M.S., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, W.H, Oxford (1979)"},{"key":"77_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0045-7906(01)00026-X","volume":"29","author":"S.-H. Wang","year":"2003","unstructured":"Wang, S.-H.: An improved stepsize of the subgradient algorithm for solving the lagrangian relaxation problem. Computers and Electrical Engineering\u00a029, 245\u2013249 (2003)","journal-title":"Computers and Electrical Engineering"},{"key":"77_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-45586-8_4","volume-title":"Computational Combinatorial Optimization","author":"C. Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol.\u00a02241, pp. 112\u2013156. Springer, Heidelberg (2001)"},{"issue":"12","key":"77_CR7","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"M.L. Fisher","year":"2004","unstructured":"Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science\u00a050(12), 1861\u20131871 (2004)","journal-title":"Management Science"},{"key":"77_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J. Beasley","year":"1989","unstructured":"Beasley, J., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks\u00a019, 379\u2013394 (1989)","journal-title":"Networks"}],"container-title":["Communications in Computer and Information Science","Applied Informatics and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23226-8_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T15:27:20Z","timestamp":1554046040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23226-8_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232251","9783642232268"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23226-8_77","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}