{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T17:40:07Z","timestamp":1740850807314,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213789"},{"type":"electronic","value":"9783540246534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24653-4_17","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T15:08:30Z","timestamp":1294844910000},"page":"160-169","source":"Crossref","is-referenced-by-count":12,"title":["Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem"],"prefix":"10.1007","author":[{"given":"Maria","family":"Blesa","sequence":"first","affiliation":[]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Compexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Compexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Gawlick, R., Leighton, F., Rabani, Y.: On-line admission control and circuit routing for high performance computing and communication. In: 35th IEEE Symposium on Foundations of Computer Science, pp. 412\u2013423 (1994)","DOI":"10.1109\/SFCS.1994.365675"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient all-optical routing. In: 26th Annual ACM Symposium on Theory of Computing, pp. 134\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"key":"17_CR4","unstructured":"Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing and scheduling algorithms for optical networks. In: 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 412\u2013423 (1994)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-57273-2_56","volume-title":"Algorithms - ESA \u201993","author":"J. Hromkovi\u010d","year":"1993","unstructured":"Hromkovi\u010d, J., Klasing, R., St\u00f6hr, E., Wagener, H.: Gossiping in vertex-disjoing paths mode in d-dimensional grids and planar graphs. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol.\u00a0726, pp. 200\u2013211. Springer, Heidelberg (1993)"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/115994.115998","volume":"21","author":"D. Sidhu","year":"1991","unstructured":"Sidhu, D., Nair, R., Abdallah, S.: Finding disjoint paths in networks. ACM SIGCOMM Computer Communication Review\u00a021(4), 43\u201351 (1991)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.: Ant algorithms for discrete optimization. Artificial Life\u00a05(2), 137\u2013172 (1999)","journal-title":"Artificial Life"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G. Caro Di","year":"1998","unstructured":"Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research\u00a09, 317\u2013365 (1998)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"17_CR9","unstructured":"Kleinberg, J.: Approx. algorithms for disjoint paths problems. PhD thesis (1996)"},{"key":"17_CR10","first-page":"63","volume-title":"New Ideas in Optimization","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E.D., Agazzi, G.: New Ideas in Optimization, pp. 63\u201376. McGraw-Hill, London (1999)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics - Part B (2004) (to appear)","DOI":"10.1109\/TSMCB.2003.821450"},{"key":"17_CR13","unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representative Internet Topoloy Generator (2001), http:\/\/cs-pub.bu.edu\/brite\/"},{"issue":"9","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1622","DOI":"10.1109\/49.12889","volume":"6","author":"B. Waxman","year":"1988","unstructured":"Waxman, B.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications\u00a06(9), 1622\u20131671 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24653-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T17:11:29Z","timestamp":1740849089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24653-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213789","9783540246534"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24653-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}