{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:38Z","timestamp":1759063598524,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75514-2_12","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T10:34:24Z","timestamp":1190198064000},"page":"157-169","source":"Crossref","is-referenced-by-count":19,"title":["A Hybrid VNS for Connected Facility Location"],"prefix":"10.1007","author":[{"given":"Ivana","family":"Ljubi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing\u00a06(2), 126\u2013140 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D. Ghosh","year":"2003","unstructured":"Ghosh, D.: Neighbourhood search heuristics for the uncapacitated facility location problem. European Journal of Operations Research\u00a0150, 150\u2013162 (2003)","journal-title":"European Journal of Operations Research"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/780542.780597","volume-title":"STOC","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC, pp. 365\u2013372. ACM, New York (2003)"},{"key":"12_CR4","unstructured":"Harm, G., Hentenryck, P.V.: A multistart variable neighborhood search for uncapacitated facility location. In: Proceedings of MIC 2005: The Sixth Metaheuristics International Conference (2005)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-44867-5_13","volume-title":"Experimental and Efficient Algorithms","author":"M. Hoefer","year":"2003","unstructured":"Hoefer, M.: Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, pp. 165\u2013178. Springer, Heidelberg (2003)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: FOCS, pp. 613\u2013623 (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0190(02)00271-5","volume":"84","author":"S. Khuller","year":"2002","unstructured":"Khuller, S., Zhu, A.: The general steiner tree-star problem. Information Processing Letters\u00a084(4), 215\u2013220 (2002)","journal-title":"Information Processing Letters"},{"key":"12_CR8","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, 207\u2013232 (1998)","journal-title":"Networks"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M. Koerkel","year":"1989","unstructured":"Koerkel, M.: On the exact solution of large-scale simple plant location problems. European Journal of Operations Research\u00a039, 157\u2013173 (1989)","journal-title":"European Journal of Operations Research"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J. Kratica","year":"2001","unstructured":"Kratica, J., To\u0161i\u0107, D., Filipovi\u0107, V., Ljubi\u0107, I.: Solving the simple plant location problem by genetic algorithms. RAIRO - Operations Research\u00a035(1), 127\u2013142 (2001)","journal-title":"RAIRO - Operations Research"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1287\/ijoc.8.3.194","volume":"8","author":"Y. Lee","year":"1996","unstructured":"Lee, Y., Chiu, Y., Ryan, J.: A branch and cut algorithm for a Steiner tree-star problem. INFORMS Journal on Computing\u00a08(3), 194\u2013201 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"12_CR12","unstructured":"Ljubi\u0107, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Faculty of Computer Science, Vienna University of Technology (November 2004)"},{"issue":"2-3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Progamming, Series B\u00a0105(2-3), 427\u2013449 (2006)","journal-title":"Mathematical Progamming, Series B"},{"key":"12_CR14","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":"Information Processing Letters"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L. Michel","year":"2004","unstructured":"Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. European Journal of Operational Research\u00a0157(3), 576\u2013591 (2004)","journal-title":"European Journal of Operational Research"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Nuggehalli, P., Srinivasan, V., Chiasserini, C.-F.: Energy-efficient caching strategies in ad hoc wireless networks. In: MobiHoc, pp. 25\u201334 (2003)","DOI":"10.1145\/778415.778419"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C. Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica\u00a040, 245\u2013269 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02114289","volume":"6","author":"J. Xu","year":"1996","unstructured":"Xu, J., Chiu, S.Y., Glover, F.: Using tabu search to solve the Steiner tree-star problem in telecommunications network design. Telecommunication Systems\u00a06(1), 117\u2013125 (1996)","journal-title":"Telecommunication Systems"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75514-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T03:03:45Z","timestamp":1737428625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755135"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_12","relation":{},"subject":[]}}