{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:32:42Z","timestamp":1743010362030,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723820"},{"type":"electronic","value":"9783540723837"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-72383-7_91","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T18:47:40Z","timestamp":1184611660000},"page":"776-785","source":"Crossref","is-referenced-by-count":2,"title":["Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem"],"prefix":"10.1007","author":[{"given":"Jiyang","family":"Dong","sequence":"first","affiliation":[]},{"given":"Junying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: The 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a02, pp. 834\u2013843 (2001)","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"91_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TNET.2005.863451","volume":"14","author":"D. Xu","year":"2006","unstructured":"Xu, D., Chen, Y., Xiong, Y., Qiao, C.: On the Complexity of and Algorithms for Finding the Shortest Path With a Disjoint Counterpart. IEEE\/ACM Trans. Networking\u00a014, 147\u2013158 (2006)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"91_CR3","first-page":"1219","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Wang, Z., Croweroft, J.: Quality-of-service routing for supporting multimedia appli-cations. IEEE J. Select. Area. Commun.\u00a014, 1219\u20131234 (1996)","journal-title":"IEEE J. Select. Area. Commun."},{"key":"91_CR4","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/TAC.2006.872827","volume":"17","author":"Z. Jia","year":"2006","unstructured":"Jia, Z., Varaiya, P.: Heuristic Methods for Delay Constrained Least Cost Routing Using k-Shortest-Path. IEEE Trans. AC\u00a017, 707\u2013712 (2006)","journal-title":"IEEE Trans. AC"},{"key":"91_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Boland, N.: Improved Preprocessing, Labeling and Scaling Algorithms for the Weight-Constrained Shortest Path Problem. Networks\u00a042, 135\u2013153 (2003)","journal-title":"Networks"},{"key":"91_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"J.M. Jaffe","year":"1984","unstructured":"Jaffe, J.M.: Algorithm for finding paths with multiple constraints. Networks\u00a014, 95\u2013116 (1984)","journal-title":"Networks"},{"key":"91_CR7","first-page":"4","volume":"27","author":"J. Liu","year":"1999","unstructured":"Liu, J., Niu, Z., Zheng, J.: An improved routing algorithm subject to multiple constraints for ATM networks (in Chinese). ACTA ELECTRONICA SINICA\u00a027, 4\u20138 (1999)","journal-title":"ACTA ELECTRONICA SINICA"},{"key":"91_CR8","unstructured":"Dong, J., Wang, W., Zhang, J.: Accumulative competition neural network for shortest path tree computation. In: International Conference on Machine Learning and Cybernetics, vol. III, Xi\u2019an China, pp. 1157\u20131161 (2003)"},{"key":"91_CR9","first-page":"751","volume":"19","author":"J. Dong","year":"2004","unstructured":"Dong, J., Zhang, J.: Accumulating Competition Neural Networks based Multiple Constrained Routing Algorithm. Control and Decision\u00a019, 751\u2013755 (2004)","journal-title":"Control and Decision"},{"key":"91_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00206-3","volume":"69","author":"Z. Wang","year":"1999","unstructured":"Wang, Z.: On the complexity of quality of service routing. Information Processing Letters\u00a069, 111\u2013114 (1999)","journal-title":"Information Processing Letters"},{"key":"91_CR11","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M., Tragoudas, S.: An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints. In: Proceedings of the ACM SIGMENTRICS, vol.\u00a01, pp. 318\u2013327 (2000)","DOI":"10.1145\/345063.339427"},{"key":"91_CR12","first-page":"1247","volume":"99","author":"E. Gelenbe","year":"2006","unstructured":"Gelenbe, E., Liu, P., Laine, J.: Genetic algorithms for route discovery. IEEE Trans. on SMC\u2013Part B\u00a099, 1247\u20131254 (2006)","journal-title":"IEEE Trans. on SMC\u2013Part B"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72383-7_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:42:48Z","timestamp":1737290568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72383-7_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723820","9783540723837"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72383-7_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}