{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:06:19Z","timestamp":1761717979089},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648093"},{"type":"electronic","value":"9783540685333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0018547","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T03:30:21Z","timestamp":1131852621000},"page":"285-297","source":"Crossref","is-referenced-by-count":32,"title":["A parallel GRASP for the Steiner problem in graphs"],"prefix":"10.1007","author":[{"given":"Simone L.","family":"Martins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio C.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"26_CR1","unstructured":"A.C. Alvim, Evaluation of GRASP parallelization strategies (in Portuguese), M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 1998."},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley, \u201cOR-Library: Distributing test problems by electronic mail\u201d, Journal of the Operational Research Society 41 (1990), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"26_CR3","first-page":"207","volume":"12","author":"E.-A. Choukmane","year":"1978","unstructured":"E.-A. Choukmane, \u201cUne heuristique pour le probl\u00e8me de l'arbre de Steiner\u201d, RAIRO Recherche Op\u00e9rationnelle 12 (1978), 207\u2013212.","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/03052159108941063","volume":"17","author":"K.A. Dowsland","year":"1991","unstructured":"K.A. Dowsland, \u201cHill-climbing simulated annealing and the Steiner problem in graphs\u201d, Engineering Optimization 17 (1991), 91\u2013107.","journal-title":"Engineering Optimization"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C.W. Duin","year":"1989","unstructured":"C.W. Duin and A. Volgenant, \u201cReduction tests for the Steiner problem in graphs\u201d, Networks 19 (1989), 549\u2013567.","journal-title":"Networks"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7","volume":"29","author":"C.W. Duin","year":"1997","unstructured":"C.W. Duin and S. Voss, \u201cEfficient path and vertex exchange in Steiner tree algorithms\u201d, Networks 29 (1997), 89\u2013105.","journal-title":"Networks"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H. Esbensen","year":"1995","unstructured":"H. Esbensen, \u201cComputing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm\u201d, Networks 26 (1995), 173\u2013185.","journal-title":"Networks"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo and M.G. Resende, \u201cGreedy randomized adaptive search procedures\u201d, Journal of Global Optimization 6 (1995), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"26_CR9","unstructured":"M. Gendreau, J.-F. Larochelle and B. Sans\u00f3, \u201cA tabu search heuristic for the Steiner tree problem in graphs\u201d, GERAD, Rapport de recherche G-96-03, Montr\u00e9al, 1996."},{"key":"26_CR10","volume-title":"The Steiner tree problem","author":"F.K. Hwang","year":"1992","unstructured":"F.K. Hwang, D.S. Richards and P. Winter, The Steiner tree problem, NorthHolland, Amsterdam, 1992."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230160209","volume":"16","author":"A. Iwainsky","year":"1986","unstructured":"A. Iwainsky, E. Canuto, O. Taraszow and A. Villa, \u201cNetwork decomposition for the optimization of connection structures\u201d, Networks 16 (1986), 205\u2013235.","journal-title":"Networks"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1057\/jors.1993.69","volume":"44","author":"A. Kapsalis","year":"1993","unstructured":"A. Kapsalis, V.J. Rayward-Smith and G.D. Smith, \u201cSolving the graphical Steiner tree problem using genetic algorithms\u201d, Journal of the Operational Research Society44 (1993), 397\u2013406.","journal-title":"Journal of the Operational Research Society"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems\u201d, in Complexity of Computer Computations (E. Miller and J.W. Thatcher, eds.), 85\u2013103, Plenum Press, New York, 1972."},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L.T. Kou","year":"1981","unstructured":"L.T. Kou G. Markowsky and L. Berman, \u201cA fast algorithm for Steiner trees\u201d, Acta Informatica 15 (1981), 141\u2013145.","journal-title":"Acta Informatica"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, \u201cOn the shortest apanning subtree of a graph and the traveling salesman problem\u201d, Proceedings of the American Mathematical Society 7 (1956), 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-0208(08)73236-5","volume":"31","author":"N. Maculan","year":"1987","unstructured":"N. Maculan, \u201cThe Steiner problem in graphs\u201d, in Surveys in Combinatorial Optimization (S. Martello, G. Laporte, M. Minoux, and C.C. Ribeiro, eds.), Annals of Discrete Mathematics 31 (1987), 185\u2013212.","journal-title":"Surveys in Combinatorial Optimization"},{"key":"26_CR17","unstructured":"S.L. Martins, P. Pardalos, M.G. Resende. and C.C. Ribeiro, \u201cGRASP procedures for the Steiner problem in graphs\u201d, presented at the DIMACS Workshop on Randomization Methods in Algorithm Design, research report in preparation, 1997."},{"key":"26_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"K. Mehlhorn, \u201cA faster approximation for the Steiner problem in graphs\u201d, Information Processing Letters 27 (1988), 125\u2013128.","journal-title":"Information Processing Letters"},{"key":"26_CR19","first-page":"221","volume":"28","author":"M. Minoux","year":"1990","unstructured":"M. Minoux, \u201cEfficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity\u201d, INFOR 28 (1990), 221\u2013233.","journal-title":"INFOR"},{"key":"26_CR20","unstructured":"Message Passing Interface Forum, \u201cMPI: A new message-passing interface standard (version 1.1)\u201d, Technical report, University of Tennessee, Knoxville, 1995."},{"key":"26_CR21","first-page":"155","volume":"31","author":"J. Plesn\u00edk","year":"1981","unstructured":"J. Plesn\u00edk, \u201cA bound for the Steiner problem in graphs\u201d, Math. Slovaca 31 (1981), 155\u2013163.","journal-title":"Math. Slovaca"},{"key":"26_CR22","unstructured":"M. Prais and C.C. Ribeiro, \u201cReactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment\u201d, Research paper submitted for publication, Catholic University of Rio de Janeiro, Department of Computer Science, 1998."},{"key":"26_CR23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E","volume":"29","author":"M.G. Resende","year":"1997","unstructured":"M.G. Resende and C.C. Ribeiro, \u201cA GRASP for Graph Planarization\u201d, Networks 29 (1997), 173\u2013189.","journal-title":"Networks"},{"key":"26_CR24","unstructured":"C.C. Ribeiro and M.C. Souza, \u201cAn improved tabu search for the Steiner problem in graphs\u201d, Working paper, Catholic University of Rio de Janeiro, Department of Computer Science, 1997."},{"key":"26_CR25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","volume":"40","author":"S. Voss","year":"1992","unstructured":"S. Voss, \u201cSteiner's problem in graphs: Heuristic methods\u201d, Discrete Applied Mathematics 40 (1992), 45\u201372.","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR26","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/0167-8191(94)90033-7","volume":"20","author":"D.W. Walker","year":"1994","unstructured":"D.W. Walker, \u201cThe design of a standard message passing interface for distributed memory concurrent computers\u201d, Parallel Computing 20 (1994), 657\u2013673.","journal-title":"Parallel Computing"},{"key":"26_CR27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, \u201cSteiner problem in networks: A survey\u201d, Networks 17 (1987), 129\u2013167.","journal-title":"Networks"},{"key":"26_CR28","unstructured":"J. Xu, S.Y. Chiu and F. Glover, \u201cTabu search heuristics for designing a Steiner tree based digital line network\u201d, Working paper, University of Colorado at Boulder, 1995."}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T08:31:02Z","timestamp":1549269062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648093","9783540685333"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0018547","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}