{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:09Z","timestamp":1759847349720},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T00:00:00Z","timestamp":1179187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T00:00:00Z","timestamp":1179187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10732-007-9027-1","type":"journal-article","created":{"date-parts":[[2007,5,14]],"date-time":"2007-05-14T17:14:38Z","timestamp":1179162878000},"page":"69-93","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The prize-collecting generalized minimum spanning tree problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Bruce","family":"Golden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daliborka","family":"Stanojevi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,15]]},"reference":[{"key":"9027_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)"},{"issue":"2","key":"9027_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/qam\/233286","volume":"26","author":"E.J. Cockayne","year":"1968","unstructured":"Cockayne, E.J., Melzak, Z.A.: Steiner\u2019s problem for set terminals. Q. Appl. Math. 26(2), 213\u2013218 (1968)","journal-title":"Q. Appl. Math."},{"issue":"3","key":"9027_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","volume":"120","author":"M. Dror","year":"2000","unstructured":"Dror, M., Haouari, M., Chaouachi, J.: Generalized spanning trees. Eur. J. Oper. Res. 120(3), 583\u2013592 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9027_CR4","unstructured":"Duin, C.: Steiner problem in graphs: approximation, reduction, variation. Ph.D. thesis, University of Amsterdam (1993)"},{"issue":"3","key":"9027_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C. Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34(3), 181\u2013191 (1999)","journal-title":"Networks"},{"issue":"1","key":"9027_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0377-2217(02)00707-5","volume":"154","author":"C. Duin","year":"2004","unstructured":"Duin, C., Vo\u00df, S.: Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154(1), 323\u2013329 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9027_CR7","doi-asserted-by":"crossref","unstructured":"Feremans, C.: Generalized spanning trees and extensions. Ph.D. thesis, Universit\u00e9 Libre de Bruxelles (2001)","DOI":"10.1016\/S0377-2217(00)00267-8"},{"issue":"1","key":"9027_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.10009","volume":"39","author":"C. Feremans","year":"2002","unstructured":"Feremans, C., Labb\u00e9, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1), 29\u201334 (2002)","journal-title":"Networks"},{"issue":"2","key":"9027_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/net.10105","volume":"43","author":"C. Feremans","year":"2004","unstructured":"Feremans, C., Labb\u00e9, M., Laporte, G.: The generalized minimum spanning tree problem: polyhedral analysis and branch-and-cut algorithm. Networks 43(2), 71\u201386 (2004)","journal-title":"Networks"},{"issue":"3","key":"9027_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M. Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar-Gonzalez, J.J., Toth, P.: Symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997)","journal-title":"Oper. Res."},{"issue":"3","key":"9027_CR11","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/ijoc.1040.0077","volume":"17","author":"B. Golden","year":"2005","unstructured":"Golden, B., Raghavan, S., Stanojevi\u0107, D.: Heuristic search for the generalized minimum spanning tree problem. INFORMS J. Comput. 17(3), 290\u2013304 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9027_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1057\/palgrave.jors.2601821","volume":"56","author":"M. Haouari","year":"2005","unstructured":"Haouari, M., Chaouachi, J., Dror, M.: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. J.\u00a0Oper. Res. Soc. 56(4), 382\u2013389 (2005)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9027_CR13","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","volume-title":"Network Models","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol.\u00a07, pp.\u00a0503\u2013615. North-Holland, Amsterdam (1995)"},{"issue":"3","key":"9027_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"R. Martin","year":"1991","unstructured":"Martin, R.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"key":"9027_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs. Springer","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1996)"},{"issue":"4","key":"9027_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"Y.S. Myung","year":"1995","unstructured":"Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26(4), 231\u2013241 (1995)","journal-title":"Networks"},{"issue":"2","key":"9027_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/B:JMMA.0000036579.83218.8d","volume":"3","author":"P.C. Pop","year":"2004","unstructured":"Pop, P.C.: New models of the generalized minimum spanning tree problem. J.\u00a0Math. Model. Algorithms 3(2), 153\u2013166 (2004)","journal-title":"J.\u00a0Math. Model. Algorithms"},{"issue":"3","key":"9027_CR18","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejor.2004.07.058","volume":"170","author":"P.C. Pop","year":"2006","unstructured":"Pop, P.C., Kern, W., Still, G.: A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170(3), 900\u2013908 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9027_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/0952813021000032699","volume":"15","author":"S.J. Shyu","year":"2003","unstructured":"Shyu, S.J., Yin, P.Y., Lin, B.M.T., Haouari, M.: Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J.\u00a0Exp. Theor. Artif. Intell. 15(1), 103\u2013112 (2003)","journal-title":"J.\u00a0Exp. Theor. Artif. Intell."},{"issue":"4","key":"9027_CR20","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585\u2013591 (1997)","journal-title":"J. ACM"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9027-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-007-9027-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10732-007-9027-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9027-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T21:13:41Z","timestamp":1683839621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-007-9027-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9027"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9027-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,15]]},"assertion":[{"value":"31 December 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2006","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2007","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}