{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:28:09Z","timestamp":1714692489062},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1007\/bf00248006","type":"journal-article","created":{"date-parts":[[2004,9,17]],"date-time":"2004-09-17T23:19:52Z","timestamp":1095463192000},"page":"5-14","source":"Crossref","is-referenced-by-count":12,"title":["A heuristic for the Steiner problem in graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"B. N.","family":"Khoury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"no. 11","key":"BF00248006_CR1","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 J. of Oper. Res. Soc., vol. 41, no. 11, pp. 1069\u20131072, 1990.","journal-title":"J. of Oper. Res. Soc."},{"key":"BF00248006_CR2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(92)90214-T","volume":"58","author":"J.E. Beasley","year":"1992","unstructured":"J.E. Beasley, \u201cA heuristic for Euclidean and rectilinear Steiner problems,\u201d Europ. J. of Oper. Res., vol. 58, pp. 284\u2013292, 1992.","journal-title":"Europ. J. of Oper. Res."},{"key":"BF00248006_CR3","doi-asserted-by":"crossref","unstructured":"D.-Z. Du, \u201cApproximating the Steiner minimum tree,\u201d in Complexity in Numerical Optimization (P.M. Pardalos Ed.), World Scientific, pp. 88\u2013106, 1993.","DOI":"10.1142\/9789814354363_0006"},{"key":"BF00248006_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S.L. Hakimi","year":"1971","unstructured":"S.L. Hakimi, \u201cSteiner's problem in graphs and its implications,\u201d Networks, vol. 1, pp. 113\u2013133, 1971.","journal-title":"Networks"},{"key":"BF00248006_CR5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","volume":"30","author":"F.K. Hwang","year":"1976","unstructured":"F.K. Hwang, \u201cOn Steiner minimal trees with rectilinear distance,\u201d SIAM J. Appl. Math., vol. 30, pp. 104\u2013114, 1976.","journal-title":"SIAM J. Appl. Math."},{"key":"BF00248006_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"2","author":"F.K. Hwang","year":"1992","unstructured":"F.K. Hwang and D.S. Richards, \u201cSteiner tree problems,\u201d Networks, vol. 2, pp. 55\u201389, 1992.","journal-title":"Networks"},{"key":"BF00248006_CR7","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, Elsevier: Amsterdam, 1992."},{"key":"BF00248006_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Communications","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems,\u201d Complexity of Computer Communications (R.E. Miller and J.W. Tatcher, Eds.), pp. 85\u2013103, Plenum Press: New York, 1972."},{"issue":"no. 4","key":"BF00248006_CR9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/168173.168420","volume":"19","author":"B.N. Khoury","year":"1993","unstructured":"B.N. Khoury, P.M. Pardalos, and D.-Z. Du, \u201cA test problem generator for the Steiner problem in graphs,\u201d ACM Transactions on Mathematical Software, vol. 19, no. 4, pp. 509\u2013522, 1993.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF00248006_CR10","doi-asserted-by":"crossref","unstructured":"B.N. Khoury, P.M. Pardalos, and D.W. Hearn, \u201cEquivalent formulations for the Steiner problem in graphs,\u201d in Network Optimization Problems (P.M. Pardalos and D.-Z. Du Eds.), World Scientific, pp. 111\u2013124, 1993.","DOI":"10.1142\/9789812798190_0007"},{"key":"BF00248006_CR11","doi-asserted-by":"crossref","unstructured":"B.N. Khoury and P.M. Pardalos, \u201cAn exact branch and bound algorithm for the Steiner problem in graphs,\u201d in Proceedings of COCOON'95, Springer-Verlag, Lecture Notes in Computer Science (D. Du and M. Li Eds.), vol. 959, pp. 582\u2013590, 1995.","DOI":"10.1007\/BFb0030880"},{"key":"BF00248006_CR12","first-page":"1477","volume":"12","author":"A. Ju Levin","year":"1971","unstructured":"A. Ju Levin, \u201cAlgorithms for the shortest connection of a group of graph vertices,\u201d Soviet Math. Doklady vol. 12, pp. 1477\u20131481, 1971.","journal-title":"Soviet Math. Doklady"},{"key":"BF00248006_CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"V.J. Rayward-Smith and A. Clare, \u201cOn finding Steiner vertices,\u201d Networks, vol. 16, pp. 283\u2013294, 1986.","journal-title":"Networks"},{"key":"BF00248006_CR14","unstructured":"J. MacGregor Smith and P. Winter (Eds.), Topological Network Design, vol. 31, nos. 1\u20134 of Annals of Operations Research, 1991."},{"key":"BF00248006_CR15","first-page":"48","volume":"15","author":"J. Soukup","year":"1973","unstructured":"J. Soukup and W.F. Chow, \u201cSet of test problems for the minimum length connection networks,\u201d ACM\/SIGMAP Newsletter, vol. 15, pp. 48\u201351, 1973.","journal-title":"ACM\/SIGMAP Newsletter"},{"key":"BF00248006_CR16","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Mutsuyama, \u201cAn approximate solution for the Steiner problem in graphs,\u201d Math. Jpn., vol. 24, pp. 573\u2013477, 1980.","journal-title":"Math. Jpn."},{"key":"BF00248006_CR17","volume-title":"Steiner-Probleme in Graphen","author":"S. Voss","year":"1990","unstructured":"S. Voss, Steiner-Probleme in Graphen, (in German), Hain, Frankfurt, 1990."},{"key":"BF00248006_CR18","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, vol. 40, pp. 45\u201372, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"BF00248006_CR19","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, vol. 17, pp. 129\u2013167, 1987.","journal-title":"Networks"},{"key":"BF00248006_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01758765","volume":"7","author":"P. Winter","year":"1992","unstructured":"P. Winter and J. MacGregor Smith, \u201cPath-distance heuristics for the Steiner problem in undirected networks,\u201d Algorithmica, vol. 7, pp. 309\u2013328, 1992.","journal-title":"Algorithmica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00248006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00248006\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00248006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T05:05:25Z","timestamp":1585890325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00248006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["BF00248006"],"URL":"https:\/\/doi.org\/10.1007\/bf00248006","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}