{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:05Z","timestamp":1725795605362},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_5","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T17:27:11Z","timestamp":1401902831000},"page":"56-70","source":"Crossref","is-referenced-by-count":2,"title":["A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs"],"prefix":"10.1007","author":[{"given":"Markus","family":"Leitner","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Luipersbeck","sequence":"additional","affiliation":[]},{"given":"Max","family":"Resch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","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., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks\u00a032(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S1571-0653(04)00247-1","volume":"7","author":"M.P. Arag\u00e3o de","year":"2001","unstructured":"de Arag\u00e3o, M.P., Uchoa, E., Werneck, R.F.F.: Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics\u00a07, 150\u2013153 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"M.X. Goemans","year":"1993","unstructured":"Goemans, M.X., Myung, Y.S.: A catalog of Steiner tree formulations. Networks\u00a023(1), 19\u201328 (1993)","journal-title":"Networks"},{"key":"5_CR4","unstructured":"Polzin, T.: Algorithms for the Steiner Problem in Networks. PhD thesis, Saarland University, Saarbrcken (2003)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R.T. Wong","year":"1984","unstructured":"Wong, R.T.: A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming\u00a028(3), 271\u2013287 (1984)","journal-title":"Mathematical Programming"},{"key":"5_CR6","unstructured":"Daneshmand, S.V.: Algorithmic Approaches to the Steiner Problem in Networks. PhD thesis, University of Mannheim, Mannheim (2003)"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"C.W. Duin","year":"1989","unstructured":"Duin, C.W., Volgenant, A.: Reduction tests for the Steiner problem in graphs. Networks\u00a019(5), 549\u2013567 (1989)","journal-title":"Networks"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1002\/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U","volume":"36","author":"C.C. Ribeiro","year":"2000","unstructured":"Ribeiro, C.C., De Souza, M.C.: Tabu search for the Steiner problem in graphs. Networks\u00a036(2), 138\u2013146 (2000)","journal-title":"Networks"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing\u00a014(3), 228\u2013246 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Uchoa, E., Werneck, R.F.F.: Fast local search for Steiner trees in graphs. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX, pp. 1\u201310. SIAM (2010)","DOI":"10.1137\/1.9781611972900.1"},{"key":"5_CR11","unstructured":"Luipersbeck, M.: A new partition-based heuristic for the Steiner tree problem in large graphs. Master\u2019s thesis, Faculty of Informatics, Vienna University of Technology (December 2013)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1016\/j.ejor.2006.03.072","volume":"189","author":"O. Guschinskaya","year":"2008","unstructured":"Guschinskaya, O., Dolgui, A., Guschinsky, N., Levin, G.: A heuristic multi-start decomposition approach for optimal design of serial machining lines. European Journal of Operational Research\u00a0189(3), 902\u2013913 (2008)","journal-title":"European Journal of Operational Research"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Taillard, \u00c9.D., Vo\u00df, S.: POPMUSIC\u2013Partial optimization metaheuristic under special intensification conditions. In: Essays and Surveys in Metaheuristics, pp. 613\u2013629. Springer (2002)","DOI":"10.1007\/978-1-4615-1507-4_27"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica\u00a019(4), 390\u2013410 (1997)","journal-title":"Algorithmica"},{"issue":"6","key":"5_CR16","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica\u00a024(6), 573\u2013577 (1980)","journal-title":"Math. Japonica"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45643-0_1","volume-title":"Algorithm Engineering and Experiments","author":"M. Poggi de Arag\u00e3o","year":"2002","unstructured":"Poggi de Arag\u00e3o, M., Werneck, R.F.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 1\u201315. Springer, Heidelberg (2002)"},{"key":"5_CR18","unstructured":"Werneck, R.F.F.: Bossa (2003), \n \n http:\/\/www.cs.princeton.edu\/~rwerneck\/bossa\/\n \n \n (visited on January 20, 2014)"},{"key":"5_CR19","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on Steiner tree problems in graphs. Technical Report 00-37, ZIB, Takustr.7, 14195, Berlin (2000)"},{"key":"5_CR20","unstructured":"Leitner, M., Ljubi\u0107, I., Luipersbeck, M., Prossegger, M., Resch, M.: New real-world instances for the Steiner tree problem in graphs. Technical report, ISOR, University of Vienna (2014)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T20:32:49Z","timestamp":1558902769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}
