{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:08Z","timestamp":1742911508338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319188324"},{"type":"electronic","value":"9783319188331"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18833-1_10","type":"book-chapter","created":{"date-parts":[[2015,5,22]],"date-time":"2015-05-22T14:48:15Z","timestamp":1432306095000},"page":"88-97","source":"Crossref","is-referenced-by-count":15,"title":["A Binary Cuckoo Search Algorithm for Solving the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Soto","sequence":"first","affiliation":[]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Olivares","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Barraza","sequence":"additional","affiliation":[]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E. Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res.\u00a044(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res.\u00a094(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M.J. 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.\u00a086, 611\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res.\u00a047(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res.\u00a098, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"10_CR6","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-0-387-71921-4_3","volume-title":"Metaheuristics","author":"M. Caserta","year":"2007","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Metaheuristics. Operations Research\/Computer Science Interfaces Series, vol.\u00a039, pp. 43\u201363. Springer, US (2007)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"S. Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program.\u00a081(2), 215\u2013228 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res.\u00a04(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10_CR9","first-page":"106","volume":"15","author":"B. Crawford","year":"2013","unstructured":"Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: Dynamic Selection of Enumeration Strategies for Solving Constraint Satisfaction Problems. Romanian Journal of Information Science and Technology\u00a015(2), 106\u2013128 (2013)","journal-title":"Romanian Journal of Information Science and Technology"},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M.L. Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Management Science\u00a036(6), 674\u2013688 (1990)","journal-title":"Management Science"},{"key":"10_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G. Lan","year":"2006","unstructured":"Lan, G., DePuy, G.W.: On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput. Ind. Eng.\u00a051(3), 362\u2013374 (2006)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"F.J. Vasko","year":"1987","unstructured":"Vasko, F.J., Wolf, F.E.: Optimal selection of ingot sizes via set covering. Oper. Res.\u00a035(3), 346\u2013353 (1987)","journal-title":"Oper. Res."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Yang, X.-S., Deb, S.: Cuckoo search via L\u00e9vy Flights. In: Proc. of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), pp. 210\u2013214. IEEE Publications, USA (December 2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"10_CR15","series-title":"SCI","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-29694-9_17","volume-title":"Artificial Intelligence, Evolutionary Computing and Metaheuristics","author":"X.S. Yang","year":"2013","unstructured":"Yang, X.S.: Bat algorithm and cuckoo search: a tutorial. In: Yang, X.S. (ed.) Artificial Intelligence, Evolutionary Computing and Metaheuristics. SCI, vol.\u00a0427, pp. 421\u2013434. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Bioinspired Computation in Artificial Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18833-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:59:54Z","timestamp":1676451594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18833-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319188324","9783319188331"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18833-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}