{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:58:40Z","timestamp":1769972320427,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1026546708757","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T17:11:16Z","timestamp":1068138676000},"page":"267-283","source":"Crossref","is-referenced-by-count":60,"title":["A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy"],"prefix":"10.1007","volume":"17","author":[{"given":"S.L.","family":"Martins","sequence":"first","affiliation":[]},{"given":"M.G.C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"C.C.","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"P.M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"258308_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Aneja, Y.P. (1980), An integer programming approach to the Steiner problem in graphs, Networks 10: 167-178.","journal-title":"Networks"},{"key":"258308_CR2","unstructured":"Bastos, M.P. and Ribeiro, C.C. (1999), Reactive tabu search with path-relinking for the Steiner problem in graphs. In Proceedings of the Third Metaheuristics International Conference, pp. 31-36."},{"key":"258308_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","volume":"14","author":"J.E. Beasley","year":"1984","unstructured":"Beasley, J.E. (1984), An algorithm for the Steiner problem in graphs. Networks 14: 147-159.","journal-title":"Networks"},{"key":"258308_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"Beasley, J.E. (1989), An SST-based algorithm for the Steiner problem in graphs. Networks 19: 1-16.","journal-title":"Networks"},{"key":"258308_CR5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E. (1990), OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41: 1069-1072.","journal-title":"Journal of the Operational Research Society"},{"key":"258308_CR6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.4.3.320","volume":"4","author":"S. Chopra","year":"1992","unstructured":"Chopra, S., Gorres, E.R. and Rao, M.R. (1992), Solving the Steiner tree problem using branch and cut. ORSA Journal on Computing 4: 320-335.","journal-title":"ORSA Journal on Computing"},{"key":"258308_CR7","first-page":"207","volume":"12","author":"E.-A. Choukmane","year":"1978","unstructured":"Choukmane, E.-A. (1978), Une heuristique pour le probleme de l'arbre de Steiner. RAIRO Recherche Op\u00e9rationnelle 12: 207-212.","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"258308_CR8","unstructured":"Claus, A. and Maculan, N. (1983), Une nouvelle formulation du probleme de Steiner sur un graphe. Technical Report 280, Centre de Recherche sur les Transports, University of Montreal."},{"key":"258308_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/03052159108941063","volume":"17","author":"K.A. Dowsland","year":"1991","unstructured":"Dowsland, K.A. (1991), Hill-climbing simulated annealing and the Steiner problem in graphs. Engineering Optimization 17: 91-107.","journal-title":"Engineering Optimization"},{"key":"258308_CR10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C.W. Duin","year":"1989","unstructured":"Duin, C.W. and Volgenant, A. (1989) Reduction tests for the Steiner problem in graphs. Networks 19: 549-567.","journal-title":"Networks"},{"key":"258308_CR11","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":"Duin, C.W. and Voss, S. (1997), Efficient path and vertex exchange in Steiner tree algorithms. Networks 29: 89-105.","journal-title":"Networks"},{"key":"258308_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230260403","volume":"26","author":"H. Esbensen","year":"1995","unstructured":"Esbensen, H. (1995), Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. Networks 26: 173-185.","journal-title":"Networks"},{"key":"258308_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A. and Resende, M.G.C. (1989), A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8: 67-71.","journal-title":"Operations Research Letters"},{"key":"258308_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A. and Resende, M.G.C. (1995), Greedy randomized adaptive search procedures. Journal of Global Optimization 6: 109-133.","journal-title":"Journal of Global Optimization"},{"key":"258308_CR15","doi-asserted-by":"crossref","unstructured":"Glover, F. (1996), Tabu search and adaptive memory programming \u2014 Advances, applications and challenges. Technical report, University of Colorado, 1996.","DOI":"10.1007\/978-1-4615-4102-8_1"},{"key":"258308_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and Laguna, M. (1997), Tabu Search. Kluwer Academic Publishers, Dordrecht."},{"key":"258308_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"M.X. Goemans","year":"1994","unstructured":"Goemans, M.X. (1994), The Steiner tree polytope and related polyhedra. Mathematical Programming 63: 157-182.","journal-title":"Mathematical Programming"},{"key":"258308_CR18","volume-title":"The Steiner tree problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S. and Winter, P. (1992), The Steiner tree problem. North-Holland, Amsterdam."},{"key":"258308_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1057\/jors.1993.69","volume":"44","author":"A. Kapsalis","year":"1993","unstructured":"Kapsalis, A., Rayward-Smith, V.J. and Smith, G.D. (1993), Solving the graphical Steiner tree problem using genetic algorithms. Journal of the Operational Research Society 44: 397-406.","journal-title":"Journal of the Operational Research Society"},{"key":"258308_CR20","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1972), Reducibility among combinatorial problems, In Miller, E. and Thatcher, J.W. (eds.), Complexity of Computer Computations, Plenum Press, pp. 85-103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"258308_CR21","doi-asserted-by":"crossref","unstructured":"Khoury, B.N., Pardalos, P.M. and Hearn, D.W. (1993), Equivalent formulations for the Steiner problem in graphs. In Du, D.-Z. and Pardalos, P.M. (eds.), Network Optimization Problems, World Scientific, pp. 111-123.","DOI":"10.1142\/9789812798190_0007"},{"key":"258308_CR22","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T. and Martin, A. (1998), Solving Steiner tree problems in graphs to optimality. Networks 32: 207-232.","journal-title":"Networks"},{"key":"258308_CR23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L.T. Kou","year":"1981","unstructured":"Kou, L.T., Markowsky, G. and Berman, L. (1981), A fast algorithm for Steiner trees. Acta Informatica 15: 141-145.","journal-title":"Acta Informatica"},{"key":"258308_CR24","unstructured":"Lucena, A. (1993), Tight bounds for the Steiner problem in graphs. Technical report, IRC for Process Systems Engineering, Imperial College."},{"key":"258308_CR25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01582065","volume":"63","author":"F. Margot","year":"1994","unstructured":"Margot, F., Prodon, A. and Liebling, Th.M. (1994), Tree polyhedron on 2-tree. Mathematical Programming 63: 183-192.","journal-title":"Mathematical Programming"},{"key":"258308_CR26","doi-asserted-by":"crossref","unstructured":"Martins, S.L., Pardalos, P.M., Resende, M.G. and Ribeiro, C.C. (1998), GRASP procedures for the Steiner problem in graphs. In Pardalos, P., Rajasekaran, S. and Rolim, J. (eds.), Randomization Methods in Algorithm Design, volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 133-145.","DOI":"10.1090\/dimacs\/043\/08"},{"key":"258308_CR27","first-page":"310","volume":"1457","author":"S.L. Martins","year":"1998","unstructured":"Martins, S.L. Ribeiro, C.C. and Souza, M.C. (1998), A parallel GRASP for the Steiner problem in graphs. In Proceedings of IRREGULAR' 98 \u2014 5th International Symposium on Solving Irregularly Structured Problems in Parallel, volume 1457 of Lecture Notes in Computer Science, Springer-Verlag, pp. 310-331.","journal-title":"Proceedings of IRREGULAR' 98 \u2014 5th International Symposium on Solving Irregularly Structured Problems in Parallel"},{"key":"258308_CR28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"Mehlhorn, K. (1988), A faster approximation for the Steiner problem in graphs. Information Processing Letters 27: 125-128.","journal-title":"Information Processing Letters"},{"key":"258308_CR29","unstructured":"Message Passing Interface Forum. MPI: A new message-passing interface standard (version 1.1). Technical report, University of Tennessee, 1995."},{"key":"258308_CR30","first-page":"221","volume":"28","author":"M. Minoux","year":"1990","unstructured":"Minoux, M. (1990), Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity. INFOR 28: 221-233.","journal-title":"INFOR"},{"key":"258308_CR31","first-page":"155","volume":"31","author":"J. Plesn\u00edk","year":"1981","unstructured":"Plesn\u00edk, J. (1981), A bound for the Steiner problem in graphs. Math. Slovaca 31: 155-163.","journal-title":"Math. Slovaca"},{"key":"258308_CR32","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"Rayward-Smith, V.J. and Clare, A. (1986), On finding Steiner vertices. Networks 16: 283-294.","journal-title":"Networks"},{"key":"258308_CR33","doi-asserted-by":"crossref","unstructured":"Ribeiro, C.C. and Souza, M.C. (2000), Tabu search for the Steiner problem in graphs. Networks (in press).","DOI":"10.1002\/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U"},{"key":"258308_CR34","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H. and Matsuyama, A. (1980), An approximate solution for the Steiner problem in graphs. Math. Japonica 24: 573-577.","journal-title":"Math. Japonica"},{"key":"258308_CR35","unstructured":"Verhoeven, M.G.A., Severens, M.E.M. and Aarts, E.H.L. (1996), Local search for Steiner trees in graphs. In Rayward-Smith, V.J. et al. (eds.), Modern Heuristics Search Methods, John Wiley and Sons, pp. 117-129."},{"key":"258308_CR36","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","volume":"40","author":"S. Voss","year":"1992","unstructured":"Voss, S. (1992), Steiner's problem in graphs: Heuristic methods. Discrete Applied Mathematics 40: 45-72.","journal-title":"Discrete Applied Mathematics"},{"key":"258308_CR37","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"Wong, R.T. (1984), A dual ascent approach for Steiner tree problems on directed graphs. Mathematical Programming 28: 271-287.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026546708757.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026546708757\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026546708757.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:41:16Z","timestamp":1751366476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026546708757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":37,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["258308"],"URL":"https:\/\/doi.org\/10.1023\/a:1026546708757","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}