{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:39:46Z","timestamp":1743118786719,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319198231"},{"type":"electronic","value":"9783319198248"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19824-8_13","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T09:06:18Z","timestamp":1433581578000},"page":"159-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Minimisation of Network Covering Services in a Threshold Distance"],"prefix":"10.1007","author":[{"given":"Milo\u0161","family":"\u0160eda","sequence":"first","affiliation":[]},{"given":"Pavel","family":"\u0160eda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"11","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 11, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94, 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"13_CR4","volume-title":"The Design of Innovation (Genetic Algorithms and Evolutionary Computation)","author":"DE Goldberg","year":"2002","unstructured":"Goldberg, D.E.: The Design of Innovation (Genetic Algorithms and Evolutionary Computation). Kluwer Academic Publishers, Dordrecht (2002)"},{"volume-title":"The Traveling Salesman Problem and Its Variations","year":"2002","key":"13_CR5","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"ANTS 2004","author":"L Lessing","year":"2004","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between ACO algorithms for the set covering problem. In: Dorigo, M. (ed.) ANTS 2004. Lecture Notes in Computer Science, vol. 3172, pp. 1\u201312. Springer-Verlag, Berlin (2004)"},{"key":"13_CR7","volume-title":"Genetic Algorithms\u00a0+\u00a0Data Structures\u00a0=\u00a0Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms\u00a0+\u00a0Data Structures\u00a0=\u00a0Evolution Programs, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"key":"13_CR8","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2002","unstructured":"Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin (2002)"},{"key":"13_CR9","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"CR Reeves","year":"1993","unstructured":"Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford (1993)"},{"key":"13_CR10","first-page":"26","volume":"8","author":"M \u0160eda","year":"2014","unstructured":"\u0160eda, M., Roupec, J., \u0160edov\u00e1, J.: Transportation problem and related tasks with application in agriculture. Int. J. Appl. Math. Inf. 8, 26\u201333 (2014)","journal-title":"Int. J. Appl. Math. Inf."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., McReady, W.G.: No Free Lunch Theorems for Optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"volume-title":"Handbook of Optimization: From Classical to Modern Approach. Berlin","year":"2013","key":"13_CR12","unstructured":"Zelinka, I., Sn\u00e1\u0161el, V., Abraham, A. (eds.): Handbook of Optimization: From Classical to Modern Approach. Berlin. Springer, Berlin (2013)"},{"key":"13_CR13","unstructured":"Matousek, R.: HC12: the principle of CUDA implementation. In: Proceedings of 16th International Conference on Soft Computing \u2013 MENDEL 2010. Mendel series vol. 2010, pp. 303\u2013308, Brno (2010), ISSN: 1803-3814"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Matousek, R., Zampachova, E.: Promissing GAHC and HC12 algorithms in global optimization tasks. J. Optim. Methods Softw. 26(3), 405\u2013419 (2011)","DOI":"10.1080\/10556788.2011.556826"}],"container-title":["Advances in Intelligent Systems and Computing","Mendel 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19824-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T10:22:26Z","timestamp":1676456546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19824-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319198231","9783319198248"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19824-8_13","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}