{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:17:15Z","timestamp":1779365835890,"version":"3.53.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540755135","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75514-2_1","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T10:34:24Z","timestamp":1190198064000},"page":"1-15","source":"Crossref","is-referenced-by-count":35,"title":["Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Wolf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Merz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","first-page":"245","volume-title":"New Ideas in Optimization","author":"P. Merz","year":"1999","unstructured":"Merz, P., Freisleben, B.: Fitness Landscapes and Memetic Algorithm Design. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 245\u2013260. McGraw\u2013Hill, London (1999)"},{"key":"1_CR2","unstructured":"Merz, P.: Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany (2000)"},{"key":"1_CR3","series-title":"The Morgan Kaufmann Series in Artificial Intelligence","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, San Francisco (2004)"},{"key":"1_CR4","unstructured":"Merz, P., Fischer, T.: A Memetic Algorithm for Large Traveling Salesman Problem Instances. In: MIC 2007. 7th Metaheuristics International Conference (2007)"},{"key":"1_CR5","unstructured":"Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering, pp. 49\u201362 (2003)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","first-page":"221","volume-title":"GCC 2004 Workshops","author":"D. Li","year":"2004","unstructured":"Li, D., Xiao, N., Lu, X.: Topology and resource discovery in Peer-to-Peer overlay networks. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds.) GCC 2004. LNCS, vol.\u00a03252, pp. 221\u2013228. Springer, Heidelberg (2004)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"M.E. O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research\u00a032, 393\u2013404 (1987)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1_CR8","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1287\/mnsc.41.4.713","volume":"41","author":"M.E. O\u2019Kelly","year":"1995","unstructured":"O\u2019Kelly, M.E., Skorin-Kapov, D., Skorin-Kapov, J.: Lower bounds for the hub location problem. Management Science\u00a041(4), 713\u2013721 (1995)","journal-title":"Management Science"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"A.T. Ernst","year":"1996","unstructured":"Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science\u00a04(3), 139\u2013154 (1996)","journal-title":"Location Science"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(99)00370-7","volume":"128","author":"J. Ebery","year":"2001","unstructured":"Ebery, J.: Solving large single allocation p-hub problems with two or three hubs. European Journal of Operational Research\u00a0128(2), 447\u2013458 (2001)","journal-title":"European Journal of Operational Research"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0377-2217(94)90245-3","volume":"73","author":"D. Skorin-Kapov","year":"1994","unstructured":"Skorin-Kapov, D., Skorin-Kapov, J.: On tabu search for the location of interacting hub facilities. European Journal of Operational Research\u00a073, 502\u2013509 (1994)","journal-title":"European Journal of Operational Research"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1007\/3-540-44869-1_93","volume-title":"Artificial Neural Nets. Problem Solving Methods","author":"E. Dom\u00ednguez","year":"2003","unstructured":"Dom\u00ednguez, E., Mu\u00f1oz, J., M\u00e9rida, E.: A recurrent neural network model for the p-hub problem. In: Mira, J.M., \u00c1lvarez, J.R. (eds.) IWANN 2003. LNCS, vol.\u00a02687, pp. 734\u2013741. Springer, Heidelberg (2003)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, M.P., Rodr\u00edguez, F.A., Moreno-Vega, J.M.: A hybrid VNS-path relinking for the p-hub median problem. IMA Journal of Management Mathematics (2007)","DOI":"10.1093\/imaman\/dpm013"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-540-24652-7_16","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M.P. P\u00e9rez","year":"2004","unstructured":"P\u00e9rez, M.P., Rodr\u00edguez, F.A., Moreno-Vega, J.M.: On the use of path relinking for the p-hub median problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 155\u2013164. Springer, Heidelberg (2004)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2006.06.056","volume":"182","author":"J. Kratica","year":"2007","unstructured":"Kratica, J., Stanimirovi\u0107, Z., To\u0161i\u0107, D., Filipovi\u0107, V.: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research\u00a0182(1), 15\u201328 (2007)","journal-title":"European Journal of Operational Research"},{"key":"1_CR16","unstructured":"Wolf, S.: On the complexity of the uncapacitated single allocation p-hub median problem with equal weights. Internal Report 363\/07, University of Kaiserslautern, Kaiserslautern, Germany (2007), available at \n                  \n                    http:\/\/dag.informatik.uni-kl.de\/papers\/Wolf2007SPSP-NP.pdf"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.10.2.149","volume":"10","author":"A.T. Ernst","year":"1998","unstructured":"Ernst, A.T., Krishnamoorthy, M.: An exact solution approach based on shortest-paths for p-hub median problems. INFORMS Journal on Computing\u00a010(2), 149\u2013162 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR18","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353 (2002)"},{"key":"1_CR19","first-page":"91","volume-title":"SODA 1990","author":"J.L. Bentley","year":"1990","unstructured":"Bentley, J.L.: Experiments on traveling salesman heuristics. In: SODA 1990. Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 91\u201399. ACM Press, New York (1990)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Griffin, T.G., Pias, M.: The Interdomain Connectivity of PlanetLab Nodes. In: Barakat, C., Pratt, I. (eds.) Proc. of the 5th International Workshop on Passive and Active Network Measurement (2004)","DOI":"10.1007\/978-3-540-24668-8_8"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0966-8349(96)00015-0","volume":"4","author":"M.E. O\u2019Kelly","year":"1996","unstructured":"O\u2019Kelly, M.E., Bryan, D.L., Skorin-Kapov, D., Skorin-Kapov, J.: Hub network design with single and multiple allocation: A computational study. Location Science\u00a04(3), 125\u2013138 (1996)","journal-title":"Location Science"},{"key":"1_CR22","unstructured":"ILOG S.A.: ILOG CPLEX User\u2019s Manual, Gentilly, France, and Mountain View, California (2006), \n                  \n                    http:\/\/www.cplex.com\/"}],"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_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:22:32Z","timestamp":1619518952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755135"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_1","relation":{},"subject":[]}}