{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T11:40:03Z","timestamp":1737546003150,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540419204"},{"type":"electronic","value":"9783540453659"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45365-2_7","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T02:42:21Z","timestamp":1191724941000},"page":"60-69","source":"Crossref","is-referenced-by-count":0,"title":["Coloured Ant System and Local Search to Design Local Telecommunication Networks"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Cordone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,6]]},"reference":[{"key":"7_CR1","volume-title":"A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem","author":"R. Patterson","year":"1998","unstructured":"R. Patterson, E. Rolland, and H. Pirkul. A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. Working paper, University of California, Riverside, September 4th, 1998."},{"key":"7_CR2","unstructured":"R. Cordone and F. Maffioli. A coloured ant system approach to graph tree partition. In Proceedings of the ANTS\u2019 2000 Conference, Brussels, Belgium, September, 2000."},{"key":"7_CR3","unstructured":"R. Cordone and F. Maffioli. On graph tree partition problems. In Proceedings of EURO XVII, Budapest, Hungary, July 16-19th, 2000."},{"issue":"1-3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0166-218X(98)00052-3","volume":"87","author":"N. Guttmann-Beck","year":"1998","unstructured":"N. Guttmann-Beck and R. Hassin. Approximation algorithms for minimum tree partition. Discrete Applied Mathematics, 87(1-3):117\u2013137, October 1st, 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR5","first-page":"9","volume":"1","author":"A. Amberg","year":"1996","unstructured":"A. Amberg, W. Domschke, and S. Vo\u00df. Capacitated minimum spanning trees: Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1:9\u201339, 1996.","journal-title":"Combinatorial Optimization: Theory and Practice"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/mnsc.34.3.331","volume":"32","author":"K. Altinkemer","year":"1988","unstructured":"K. Altinkemer and B. Gavish. Heuristics with constant error guarantees for the design of tree networks. Management Science, 32:331\u2013341, 1988.","journal-title":"Management Science"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(93)90097-Z","volume":"14","author":"C. Imieli\u0144ska","year":"1993","unstructured":"C. Imieli\u0144ska, B. Kalantari, and L. Khachiyan. A greedy heuristic for a minimum weight forest problem. Operations Research Letters, 14:65\u201371, September 1993.","journal-title":"Operations Research Letters"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 26(1):29\u201341, 1996.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"D. Costa and A. Hertz. Ants can colour graphs. Journal of Operational Research Society, 48:295\u2013305, 1997.","journal-title":"Journal of Operational Research Society"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"V. Maniezzo and A. Colorni. The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering, 1999.","DOI":"10.1109\/69.806935"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"T. St\u00fctzle and H. Hoos. The MAX-MIN Ant System and local search for the traveling salesman problem. In T. B\u00e4ck, Z. Michalewicz, and X. Yao, editors, Proceedings of The IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pages 309\u2013314, Piscataway, NJ, 1997. IEEE Press.","DOI":"10.1109\/ICEC.1997.592327"},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1007\/3-540-61723-X_1029","volume-title":"A study of some properties of Ant-Q","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo and L.M. Gambardella. A study of some properties of Ant-Q. Lecture Notes in Computer Science, 1141:656\u2013665, 1996."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53\u201366, April 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"7_CR14","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"B. Bullnheimer, R.F. Hartl, and C. Strauss. A new rank based version of the ant system: A computational study. Central European Journal for Operations Research and Economics, 7(1):25\u201338, 1999.","journal-title":"Central European Journal for Operations Research and Economics"},{"key":"7_CR15","unstructured":"L.M. Gambardella, E. Taillard, and G. Agazzi. Ant colonies for vehicle routing problems. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw-Hill, 1999."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389, 1957.","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<162::AID-NET9>3.0.CO;2-9","volume":"34","author":"M. Gendreau","year":"1999","unstructured":"M. Gendreau, J.-F. Larochelle, and B. Sans\u00f2. A tabu search heuristic for the Steiner tree problem. Networks, 34(2):162\u2013172, September 1999.","journal-title":"Networks"},{"key":"7_CR18","unstructured":"J.E. Beasley. OR-Library. http:\/\/www.mscmga.ms.ic.ac.uk\/info.html , 1999."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45365-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:35:18Z","timestamp":1737462918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45365-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540419204","9783540453659"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45365-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}