{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:56:00Z","timestamp":1742928960830,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420066"},{"type":"electronic","value":"9783319420073"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42007-3_72","type":"book-chapter","created":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T04:38:22Z","timestamp":1468384702000},"page":"855-861","source":"Crossref","is-referenced-by-count":1,"title":["A Black Hole Algorithm for Solving the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Soto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio","family":"Figueroa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefanie","family":"Niklander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,14]]},"reference":[{"issue":"3","key":"72_CR1","first-page":"203","volume":"5","author":"E Balas","year":"1997","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Locat. Sci. 5(3), 203\u2013203 (1997)","journal-title":"Locat. Sci."},{"issue":"1","key":"72_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"72_CR3","doi-asserted-by":"crossref","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(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"72_CR4","doi-asserted-by":"crossref","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 coveragecorrelated set covering problems. Ann. Oper. Res. 86, 611\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"key":"72_CR5","first-page":"43","volume-title":"Operations Research\/Computer Science Interfaces Series","author":"M Caserta","year":"2007","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Operations Research\/Computer Science Interfaces Series, vol. 39, pp. 43\u201363. Springer, New York (2007)"},{"key":"72_CR6","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"S Ceria","year":"1997","unstructured":"Ceria, S., Nobili, P., Sassano, A.: Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester (1997)"},{"key":"72_CR7","series-title":"Lecture Notes in Computer Science","first-page":"41","volume-title":"Intelligent Information and Database Systems","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, C., Palma, W., Johnson, F., Paredes, F.: Solving the set covering problem with a shuffled frog leaping algorithm. In: Nguyen, N.T., Trawi\u0144ski, B., Kosala, R. (eds.) ACIIDS 2015. LNCS, vol. 9012, pp. 41\u201350. Springer, Heidelberg (2015)"},{"key":"72_CR8","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-319-18473-9_30","volume-title":"Software Engineering in Intelligent Systems","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Riquelme-Leiva, M., Pe\u00f1a, C., Torres-Rojas, C., Johnson, F., Paredes, F.: Modified binary firefly algorithms with different transfer functions for solving set covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 307\u2013315. Springer, Heidelberg (2015)"},{"key":"72_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-319-06740-7_5","volume-title":"Modern Trends and Techniques in Computer Science","author":"R Cuesta","year":"2014","unstructured":"Cuesta, R., Crawford, B., Soto, R., Paredes, F.: An artificial bee colony algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol. 285, pp. 53\u201363. Springer, Switzerland (2014)"},{"issue":"1","key":"72_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 101(1), 81\u201392 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"72_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175\u2013184 (2013)","journal-title":"Inf. Sci."},{"key":"72_CR12","series-title":"International Series of Numerical Mathematics","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-0348-5936-3_10","volume-title":"Numerische Methoden bei Optimierungsaufgaben","author":"J Krarup","year":"1977","unstructured":"Krarup, J., Bilde, O.: Plant location, set covering and economic lot size: an 0 (mn)-algorithm for structured problems. In: Collatz, L., Meinardus, G., Wetterling, W. (eds.) Numerische Methoden bei Optimierungsaufgaben. International Series of Numerical Mathematics, vol. 36, pp. 155\u2013180. Birkhuser, Basel (1977)"},{"key":"72_CR13","volume-title":"A Study of Different Transfer Functions for Binary Version of Particle Swarm Optimization","author":"S Mirjalili","year":"2011","unstructured":"Mirjalili, S., Hashim, S., Taherzadeh, G., Mirjalili, S., Salehi, S.: A Study of Different Transfer Functions for Binary Version of Particle Swarm Optimization. CSREA Press, Las Vegas (2011)"},{"key":"72_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili, S., Lewis, A.: S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1\u201314 (2013)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"72_CR15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1063\/1.3022513","volume":"24","author":"R Ruffini","year":"1971","unstructured":"Ruffini, R., Wheeler, J.A.: Introducing the black hole. Phys. Today 24(1), 30 (1971)","journal-title":"Phys. Today"},{"key":"72_CR16","first-page":"208","volume-title":"Proceedings of the 1st International Conference on Advanced Intelligent System and Informatics (AISI)","author":"R Soto","year":"2016","unstructured":"Soto, R., Crawford, B., Lizama, S., Johnson, F., Paredes, F.: A XOR-based ABC algorithm for solving set covering problems. In: Gaber, T., Hassanien, A.E., El-Bendary, N., Dey, N. (eds.) Proceedings of the 1st International Conference on Advanced Intelligent System and Informatics (AISI). AISC, vol. 407, pp. 208\u2013218. Springer, Switzerland (2016)"},{"key":"72_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-319-18476-0_10","volume-title":"Artificial Intelligence Perspectives and Applications","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Mu\u00f1oz, A., Johnson, F., Paredes, F.: Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 89\u201397. Springer, Heidelberg (2015)"},{"key":"72_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ins.2015.01.035","volume":"308","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Palma, W., Galleguillos, K., Castro, C., Monfroy, E., Johnson, F., Paredes, F.: Boosting autonomous search for CSPs via skylines. Inf. Sci. 308, 38\u201348 (2015)","journal-title":"Inf. Sci."},{"issue":"3","key":"72_CR19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: Np-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"72_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.15837\/ijccc.2012.2.1417","volume":"7","author":"C Valenzuela","year":"2014","unstructured":"Valenzuela, C., Crawford, B., Soto, R., Monfroy, E., Paredes, F.: A 2-level metaheuristic for the set covering problem. Int. J. Comput. Commun. Control 7(2), 377 (2014)","journal-title":"Int. J. Comput. Commun. Control"}],"container-title":["Lecture Notes in Computer Science","Trends in Applied Knowledge-Based Systems and Data Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42007-3_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:19:31Z","timestamp":1498313971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42007-3_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420066","9783319420073"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42007-3_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}