{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:31Z","timestamp":1725565051997},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_20","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T17:18:16Z","timestamp":1283966296000},"page":"156-163","source":"Crossref","is-referenced-by-count":4,"title":["A Grid Enabled Parallel Hybrid Genetic Algorithm for SPN"],"prefix":"10.1007","author":[{"given":"Giuseppe Lo","family":"Presti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe Lo","family":"Re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro","family":"Storniolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfonso","family":"Urso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. Kruskal","year":"1956","unstructured":"Kruskal, J.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. Amer. Math. Soc.\u00a07, 48\u201350 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: R.E. Miller, J.W. Thatcher, Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"20_CR3","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japan, 573\u2013577 (1980)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/0020739830140103","volume":"14","author":"V.J. Rayward-Smith","year":"1983","unstructured":"Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Int. Math. Ed. Sci. Tech.\u00a014, 15\u201323 (1983)","journal-title":"Int. Math. Ed. Sci. Tech."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in networks: a survey. Networks\u00a017, 129\u2013167 (1987)","journal-title":"Networks"},{"key":"20_CR6","volume-title":"Genetic algorithm in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithm in Search, Optimization, and Machine Learning. Addison Wesley, Reading (1989)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/03052159108941063","volume":"17","author":"K.A. Dowsland","year":"1991","unstructured":"Dowsland, K.A.: Hill-climbing, Simulated Annealing and the Steiner Problem in Graphs. Engineering Optimisation\u00a017, 91\u2013107 (1991)","journal-title":"Engineering Optimisation"},{"key":"20_CR8","unstructured":"Cantu-Paz, E.: A summary of research on parallel genetic algorithms, Illinois GALab, Univ. Illinois Urbana-Champaign, Urbana, IL, Tech. Rep. 950076 (July 1995)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Esbensen, H.: Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm. Networks: An International Journal\u00a026 (1995)","DOI":"10.1002\/net.3230260403"},{"key":"20_CR10","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":"Gendreau, M., Larochelle, J.F., Sanso, B.: A Tabu Search Heuristic for the Steiner Tree Problem. Networks\u00a034, 162\u2013172 (1999)","journal-title":"Networks"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Di Fatta, G., Lo Re, G.: Efficient tree construction for the multicast problem, Special issue of the Journal of the Brazilian Telecommunications Society (1999)","DOI":"10.14209\/jcis.1999.4"},{"key":"20_CR12","unstructured":"Govindan, R., Tangmunarunkit, H.: Heuristics for Internet Map Discovery. In: Proc. IEEE Infocom 2000, Tel Aviv, Israel (2000), www.isi.edu\/scan\/mercator\/mercator.html"},{"key":"20_CR13","unstructured":"Voss, S., Martin, A., Koch, T.: SteinLib Testdata Library (February 2001), elib.zib.de\/steinlib\/steinlib.php"},{"key":"20_CR14","unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE Topology Generator (April 2001), cs-pub.bu.edu\/brite"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/4235.942527","volume":"5","author":"G. Folino","year":"2001","unstructured":"Folino, G., Pizzuti, C., Spezzano, G.: Parallel Hybrid Method for SAT That Couples Genetic Algorithms and Local Search. IEEE Transactions on Evolutionary Computation\u00a05(4), 323\u2013334 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"20_CR16","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/S0743-7315(03)00002-9","volume":"63","author":"N. Karonis","year":"2003","unstructured":"Karonis, N., Toonen, B., Foster, I.: MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface. Journal of Parallel and Distributed Computing (JPDC)\u00a063(5), 551\u2013563 (2003)","journal-title":"Journal of Parallel and Distributed Computing (JPDC)"},{"key":"20_CR17","unstructured":"Di Fatta, G., Lo Presti, G., Lo Re, G.: A Parallel Genetic Algorithm for the Steiner Problem in Networks. In: Proc. of the 15th IASTED Int. Conference on Parallel and Distributed Computing and Systems, Marina del Rey (CA), USA (November 2003)"},{"key":"20_CR18","unstructured":"GAlib: a C++ Library of Genetic Algorithm Components, http:\/\/lancet.mit.edu\/ga\/"},{"key":"20_CR19","unstructured":"Sandholm, T., Gawor, J.: Globus Toolkit 3 Core \u2013 A Grid Service Container Framework, http:\/\/www-unix.globus.org\/toolkit\/3.0\/ogsa\/docs\/gt3core.pdf"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:56:23Z","timestamp":1636419383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}