{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:49:56Z","timestamp":1744213796137,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223443"},{"type":"electronic","value":"9783540248545"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24854-5_125","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:40:42Z","timestamp":1284489642000},"page":"1304-1315","source":"Crossref","is-referenced-by-count":21,"title":["Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Gunnar W.","family":"Klau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Neuner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"125_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Prog.\u00a059, 413\u2013420 (1993)","journal-title":"Math. Prog."},{"key":"125_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks\u00a038, 50\u201358 (2001)","journal-title":"Networks"},{"issue":"2","key":"125_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/net.3230170309","volume":"17","author":"C.W. Duin","year":"1987","unstructured":"Duin, C.W., Volgenant, A.: Some generalizations of the Steiner problem in graphs. Networks\u00a017(2), 353\u2013364 (1987)","journal-title":"Networks"},{"issue":"1","key":"125_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/(SICI)1097-0037(199801)31:1<11::AID-NET2>3.0.CO;2-N","volume":"31","author":"S. Engevall","year":"1998","unstructured":"Engevall, S., G\u00f6the-Lundgren, M., V\u00e4rbrand, P.: A strong lower bound for the node weighted Steiner tree problem. Networks\u00a031(1), 11\u201317 (1998)","journal-title":"Networks"},{"key":"125_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01586946","volume":"51","author":"M. Fischetti","year":"1991","unstructured":"Fischetti, M.: Facets of two Steiner arborescence polyhedra. Mathematical Programming\u00a051, 401\u2013419 (1991)","journal-title":"Mathematical Programming"},{"key":"125_CR6","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation algorithms for NP-hard problems, pp. 144\u2013191. P. W. S. Publishing Co. (1996)"},{"key":"125_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"M.X. Goemans","year":"1994","unstructured":"Goemans, M.X.: The Steiner tree polytope and related polyhedra. Mathematical Programming\u00a063, 157\u2013182 (1994)","journal-title":"Mathematical Programming"},{"key":"125_CR8","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting Steiner tree problem: Theory and practice. In: Proceedings of 11th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 760\u2013769 (2000)"},{"key":"125_CR9","unstructured":"Klau, G., Ljubi\u0107, I., Moser, A., Mutzel, P., Neuner, P., Pferschy, U., Weiskircher, R.: A new lower bounding procedure for the prize-collecting Steiner tree problem. Technical Report TR-186-1-04-01, Vienna University of Technology (2004)"},{"key":"125_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/978-3-540-39658-1_62","volume-title":"Algorithms - ESA 2003","author":"G.W. Klau","year":"2003","unstructured":"Klau, G.W., Ljubi\u0107, I., Mutzel, P., Pferschy, U., Weiskircher, R.: The fractional prize-collecting steiner tree problem on trees. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 691\u2013702. Springer, Heidelberg (2003)"},{"key":"125_CR11","unstructured":"Lucena, A., Resende, M.: Strong lower bounds for the prize-collecting Steiner problem in graphs. Technical Report 00.3.1, AT&T Labs Research (2000)"},{"key":"125_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation for the Steiner problem in graphs. Information. Processing Letters\u00a027, 125\u2013128 (1988)","journal-title":"Processing Letters"},{"key":"125_CR13","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: A short introduction. In: Corne, D., et al. (eds.) New Ideas in Optimization, pp. 219\u2013234. McGraw Hill, England (1999)"},{"key":"125_CR14","unstructured":"Raidl, G.R., Gottlieb, J.: On the importance of phenotypic duplicate elimination in decoder-based evolutionary algorithms. In: Brave, S., Wu, A.S. (eds.) Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, Orlando, FL, pp. 204\u2013211 (1999)"},{"issue":"3","key":"125_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"G.R. Raidl","year":"2003","unstructured":"Raidl, G.R., Julstrom, B.A.: Edge-sets: An effective evolutionary coding of spanning trees. IEEE Trans. on Evolutionary Computation\u00a07(3), 225\u2013239 (2003)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"125_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A. Segev","year":"1987","unstructured":"Segev, A.: The node-weighted Steiner tree problem. Networks\u00a017, 1\u201317 (1987)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24854-5_125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:33:25Z","timestamp":1676691205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24854-5_125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223443","9783540248545"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24854-5_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}