{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:50:12Z","timestamp":1725853812592},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336237"},{"type":"electronic","value":"9783319336251"}],"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-33625-1_43","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T14:42:39Z","timestamp":1461163359000},"page":"477-490","source":"Crossref","is-referenced-by-count":1,"title":["Fireworks Explosion Can Solve 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":"Gonzalo","family":"Astudillo","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,4,21]]},"reference":[{"key":"43_CR1","first-page":"27","volume-title":"Lecture Notes in Computer Science","author":"Broderick Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) Advances in Swarm Intelligence, 4th International Conference. Lecture Notes in Computer Science, vol. 7929, pp. 27\u201334. Springer, Harbin, China (2013)"},{"key":"43_CR2","unstructured":"Goldberg, D.: Real-Coded Genetic Algorithms, Virtual Alphabets, and Blocking. Complex Syst. 5, 139\u2013167 (1990)"},{"issue":"5","key":"43_CR3","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1016\/j.asoc.2013.02.001","volume":"13","author":"Fereidoun Amini","year":"2013","unstructured":"Amini, F., Ghaderi, P.: Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers. Appl. Soft Comput. 13, 2272\u20132280 (2013)","journal-title":"Applied Soft Computing"},{"issue":"5","key":"43_CR4","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"Broderick Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-a function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40, 1690\u20131695 (2013)","journal-title":"Expert Systems with Applications"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Palma, W., Paredes, F., Olguin, E., Norero, E.: A binary coded firefly algorithm that solves the set covering problem, vol. 17, pp. 252\u2013264 (2014)","DOI":"10.2495\/CEEIT140081"},{"key":"43_CR6","first-page":"65","volume-title":"Advances in Intelligent Systems and Computing","author":"Broderick Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: 3rd Computer Science On-line Conference 2014, Modern Trends and Techniques in Computer Science, vol. 285, pp. 65\u201373. Springer, Switzerland (2014)"},{"key":"43_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-319-15705-4_5","volume-title":"Intelligent Information and Database Systems","author":"Broderick 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., Trawinski, B., Kosala, R. (eds.) Intelligent Information and Database Systems\u20147th Asian Conference. LNCS, vol. 9012, pp. 41\u201350. Springer, Bali, Indonesia (2015)"},{"key":"43_CR8","first-page":"17","volume-title":"Fireworks Algorithm","author":"Ying Tan","year":"2015","unstructured":"Tan, Y.: Fireworks Algorithm. Springer, Berlin (2015)"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"43_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0377-2217(89)90471-2","volume":"38","author":"AI Ali","year":"1989","unstructured":"Ali, A.I., Thiagarajan, H.: A network relaxation based enumeration algorithm for set partitioning. Eur. J. Oper. Res. 38(1), 76\u201385 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1287\/opre.22.2.275","volume":"22","author":"W Walker","year":"1974","unstructured":"Walker, W.: Using the set-covering problem to assign fire companies to fire houses. Oper. Res. 22, 275\u2013277 (1974)","journal-title":"Oper. Res."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"FJ Vasko","year":"1987","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: Optimal selection of ingot sizes via set covering. Oper. Res. 35, 346\u2013353 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"ML Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Oper. Res. 12(2), 300\u2013304 (1964)","journal-title":"Oper. Res."},{"issue":"1","key":"43_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0","volume":"36","author":"ML Fisher","year":"1989","unstructured":"Fisher, M.L., Rosenwein, M.B.: An interactive optimization system for bulk-cargo ship scheduling. Naval Res. Logist. 36(1), 27\u201342 (1989)","journal-title":"Naval Res. Logist."},{"key":"43_CR15","first-page":"361","volume":"18","author":"BA Freeman","year":"1967","unstructured":"Freeman, B.A., Jucker, J.V.: The line balancing problem. J. Ind. Eng. 18, 361\u2013364 (1967)","journal-title":"J. Ind. Eng."},{"issue":"2","key":"43_CR16","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"CC Ribeiro","year":"1989","unstructured":"Ribeiro, C.C., Minoux, M., Penna, M.C.: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur. J. Oper. Res. 41(2), 232\u2013239 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/321556.321572","volume":"17","author":"MA Breuer","year":"1970","unstructured":"Breuer, M.A.: Simplification of the covering problem with application to boolean expressions. J. Assoc. Comput. Mach. 17, 166\u2013181 (1970)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"43_CR18","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1093\/comjnl\/14.4.418","volume":"14","author":"N Christofides","year":"1971","unstructured":"Christofides, N.: Zero-one programming using non-binary tree-search. Comput. J. 14(4), 418\u2013421 (1971)","journal-title":"Comput. J."},{"issue":"8","key":"43_CR19","doi-asserted-by":"publisher","first-page":"B495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"RS Garfinkel","year":"1970","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Optimal political districting by implicit enumeration techniques. Manag. Sci. 16(8), B495\u2013B508 (1970)","journal-title":"Manag. Sci."},{"issue":"5","key":"43_CR20","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E Housos","year":"1997","unstructured":"Housos, E., Elmroth, T.: Automatic optimization of subproblems in scheduling airline crews. Interfaces 27(5), 68\u201377 (1997)","journal-title":"Interfaces"},{"key":"43_CR21","doi-asserted-by":"publisher","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."},{"key":"43_CR22","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 Beasley","year":"1990","unstructured":"Beasley, J.: A lagrangian heuristic for set covering problems. Naval Res. Logist. 37, 151\u2013164 (1990)","journal-title":"Naval Res. Logist."}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33625-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T18:27:20Z","timestamp":1692296840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33625-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336237","9783319336251"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33625-1_43","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}