{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:40:39Z","timestamp":1725820839585},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184753"},{"type":"electronic","value":"9783319184760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18476-0_11","type":"book-chapter","created":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T09:40:25Z","timestamp":1429954825000},"page":"99-108","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic Feasibility and Preprocessing for a Set Covering Solver Based on Firefly Optimization"],"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":"Jos\u00e9","family":"Vilches","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"11_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."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2) (1996)","DOI":"10.1016\/0377-2217(95)00159-X"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: A Lagrangian heuristic for set covering problems. Naval Res. Logistics\u00a037(1), 151\u2013164 (1990)","journal-title":"Naval Res. Logistics"},{"issue":"2","key":"11_CR4","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":"11_CR5","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."},{"key":"11_CR6","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."},{"issue":"5","key":"11_CR7","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":"11_CR8","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering"},{"issue":"2","key":"11_CR9","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."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2013.06.022","volume":"249","author":"K. Chandrasekaran","year":"2013","unstructured":"Chandrasekaran, K., Sishaj, P.S., Padhy, N.P.: Binary real coded firefly algorithm for solving unit commitment problem. Inf. Sci.\u00a0249, 67\u201384 (2013)","journal-title":"Inf. Sci."},{"issue":"3","key":"11_CR11","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."},{"key":"11_CR12","series-title":"AISC","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-06740-7_6","volume-title":"Modern Trends and Techniques in Computer Science","author":"B. Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: A Binary Firefly 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.\u00a0285, pp. 65\u201373. Springer, Heidelberg (2014)"},{"issue":"2","key":"11_CR13","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"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Management Science 36(6) (1990)","DOI":"10.1287\/mnsc.36.6.674"},{"key":"11_CR15","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":"11_CR16","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":"11_CR17","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."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"F.J. Vasko","year":"1984","unstructured":"Vasko, F.J., Wilson, G.R.: Using a facility location algorithm to solve large set covering problems. Operations Research Letters\u00a03(2), 85\u201390 (1984)","journal-title":"Operations Research Letters"},{"key":"11_CR19","unstructured":"Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, UK (2008), Inspired Computing (NaBIC 2009), India, p. 210. IEEE Publications, USA (December 2009)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-04944-6_14","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"X.-S. Yang","year":"2009","unstructured":"Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol.\u00a05792, pp. 169\u2013178. Springer, Heidelberg (2009)"}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18476-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T22:40:48Z","timestamp":1559169648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18476-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184753","9783319184760"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18476-0_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}