{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:46:41Z","timestamp":1762004801777,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319916408"},{"type":"electronic","value":"9783319916415"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91641-5_8","type":"book-chapter","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T19:14:58Z","timestamp":1526066098000},"page":"88-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Constructive Metaheuristics for the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,12]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"U Aickelin","year":"2002","unstructured":"Aickelin, U.: An indirect genetic algorithm for set covering problems. J. Oper. Res. Soc. 53, 1118\u20131126 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J Beasley","year":"1987","unstructured":"Beasley, J.: An algorithm for set covering problem. Eur. J. Oper. Res. 31, 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR3","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":"8_CR4","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost and coverage correlated set covering problems. Ann. Oper. Res. 86, 611\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/578541","volume":"2015","author":"Broderick Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Berr\u00edos, N., Johnson, F., Paredes, F., Castro, C., Norero, E.: A binary cat swarm optimization algorithm for the non-unicost set covering problem. In: Mathematical Problems in Engineering (2015)","journal-title":"Mathematical Problems in Engineering"},{"key":"8_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-33625-1_39","volume-title":"Artificial Intelligence Perspectives in Intelligent Systems","author":"B Crawford","year":"2016","unstructured":"Crawford, B., Soto, R., C\u00f3rdova, J., Olgu\u00edn, E.: A nature inspired intelligent water drop algorithm and its application for solving the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Artificial Intelligence Perspectives in Intelligent Systems. AISC, vol. 464, pp. 437\u2013447. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-33625-1_39"},{"key":"8_CR7","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-66963-2_50","volume-title":"Applied Computer Sciences in Engineering","author":"B Crawford","year":"2017","unstructured":"Crawford, B., Soto, R., Monfroy, E., Astorga, G., Garc\u00eda, J., Cortes, E.: A meta-optimization approach for covering problems in facility location. In: Figueroa-Garc\u00eda, J.C., L\u00f3pez-Santana, E.R., Villa-Ram\u00edrez, J.L., Ferro-Escobar, R. (eds.) WEA 2017. CCIS, vol. 742, pp. 565\u2013578. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66963-2_50"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybern.)"},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M Fisher","year":"1990","unstructured":"Fisher, M., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Manag. Sci. 36(6), 674\u2013688 (1990)","journal-title":"Manag. Sci."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of np-completeness (Michael R. Garey and David S. Johnson). SIAM Rev. 24(1), 90 (1982)","journal-title":"SIAM Rev."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28646-2_1","volume-title":"Ant Colony Optimization and Swarm Intelligence","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., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 1\u201312. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-28646-2_1"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1108\/17563780810874717","volume":"1","author":"H Shah-Hosseini","year":"2008","unstructured":"Shah-Hosseini, H.: Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem. Int. J. Intell. Comput. Cybern. 1(2), 193\u2013212 (2008)","journal-title":"Int. J. Intell. Comput. Cybern."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-21404-7_14","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Galleguillos, C., Barraza, J., Lizama, S., Mu\u00f1oz, A., Vilches, J., Misra, S., Paredes, F.: Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9155, pp. 187\u2013202. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21404-7_14"}],"container-title":["Lecture Notes in Computer Science","Bioinspired Optimization Methods and Their Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91641-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T19:17:15Z","timestamp":1526066235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91641-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319916408","9783319916415"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91641-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}