{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:33Z","timestamp":1773656073731,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0377-2217(02)00707-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"323-329","source":"Crossref","is-referenced-by-count":35,"title":["Solving group Steiner problems as Steiner problems"],"prefix":"10.1016","volume":"154","author":[{"given":"C.W","family":"Duin","sequence":"first","affiliation":[]},{"given":"A","family":"Volgenant","sequence":"additional","affiliation":[]},{"given":"S","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00707-5_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/qam\/233286","article-title":"Steiner\u2019s problem for set terminals","volume":"26","author":"Cockayne","year":"1968","journal-title":"Quarterly Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","article-title":"Generalized spanning trees","volume":"120","author":"Dror","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB4","unstructured":"Duin, C.W., 1993. Steiner problem in graphs: Approximation, reduction, variation, Ph.D. thesis, University of Amsterdam"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7","article-title":"Efficient path and vertex exchange in Steiner tree algorithms","volume":"29","author":"Duin","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","article-title":"The Pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs","volume":"34","author":"Duin","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.10009","article-title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","volume":"39","author":"Feremans","year":"2002","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R","article-title":"An improved approximation scheme for the group Steiner problem","volume":"37","author":"Helvig","year":"2001","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0166-218X(98)00090-0","article-title":"Class Steiner trees and VLSI-design","volume":"90","author":"Ihler","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Information processing Letters"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB12","first-page":"221","article-title":"Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity","volume":"28","author":"Minoux","year":"1991","journal-title":"INFORMS"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB13","series-title":"Graph-Theoretic Concepts in Computer Science","article-title":"Beyond Steiner\u2019s problem: A VLSI oriented generalization","volume":"vol. 411","author":"Reich","year":"1989"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(99)00200-0","article-title":"A note on the generalized Steiner tree polytope","volume":"100","author":"Salazar","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","article-title":"On finding and updating spanning trees and shortest paths","volume":"4","author":"Spira","year":"1975","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB16","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB17","unstructured":"Vo\u00df, S., 1990. A survey on some generalizations of Steiner\u2019s problem. In: Papathanassiu, B., Giatas, K. (Eds.), 1st Balkan Conference on Operational Research Proceedings 1988. Hellenic Productivity Center, Thessaloniki, pp. 41\u201351"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB18","first-page":"383","article-title":"Generalized Steiner problem and hexagonal coordinate system","volume":"8","author":"Weng","year":"1985","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01758765","article-title":"Path-distance heuristics for the Steiner tree problem in undirected networks","volume":"7","author":"Winter","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(02)00707-5_BIB20","first-page":"53","article-title":"The Steiner tree proble","author":"Hwang","year":"1992","journal-title":"Annals of Discrete Mathematics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:57:06Z","timestamp":1553914626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0377221702007075"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00707-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}