{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:21:33Z","timestamp":1742912493284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"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_78","type":"book-chapter","created":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T08:38:22Z","timestamp":1468399102000},"page":"917-930","source":"Crossref","is-referenced-by-count":0,"title":["Binary Harmony Search Algorithm for Solving Set-Covering Problem"],"prefix":"10.1007","author":[{"given":"Juan","family":"Salas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1lvaro G\u00f3mez","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e1n","family":"Jaramillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e1n Mansilla","family":"Villablanca","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":[{"key":"78_CR1","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-21380-4_96","volume-title":"hci international 2015 - posters\u2019 extended abstracts","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Guzm\u00e1n, N., Johnson, F., Paredes, F.: Recent harmony search algorithms for 0\u20131 optimization problems. In: Stephanidis, C., Tino, A. (eds.) HCII 2015 Posters. CCIS, vol. 528, pp. 567\u2013572. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21380-4_96"},{"key":"78_CR2","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: 50 Years of Integer Programming 1958\u20132008 - From the Early Years to the State-of-the-Art, pp. 219\u2013241 (2010)","DOI":"10.1007\/978-3-540-68279-0_8"},{"issue":"1","key":"78_CR3","doi-asserted-by":"crossref","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."},{"issue":"3","key":"78_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.29.3.501","volume":"29","author":"JJ Bartholdi","year":"1981","unstructured":"Bartholdi, J.J.: A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper. Res. 29(3), 501\u2013510 (1981)","journal-title":"Oper. Res."},{"key":"78_CR5","doi-asserted-by":"crossref","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."},{"issue":"2","key":"78_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"FJ Vasko","year":"1984","unstructured":"Vasko, F.J., Wilson, G.R.: Using a facility location algorithm to solve large set covering problems. Oper. Res. Lett. 3(2), 85\u201390 (1984)","journal-title":"Oper. Res. Lett."},{"key":"78_CR7","doi-asserted-by":"crossref","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":"1","key":"78_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: A set covering approach to metallurgical grade assignment. Eur. J. Oper. Res. 38(1), 27\u201334 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"78_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.19.1.68","volume":"19","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L., Scheirer, J.W.: Selecting optimal ingot sizes for bethlehem steel. Interfaces 19(1), 68\u201384 (1989)","journal-title":"Interfaces"},{"issue":"2","key":"78_CR10","doi-asserted-by":"crossref","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."},{"key":"78_CR11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1976.63","volume":"27","author":"BA Foster","year":"1976","unstructured":"Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Oper. Res. 27, 367\u2013384 (1976)","journal-title":"Oper. Res."},{"issue":"1","key":"78_CR12","doi-asserted-by":"crossref","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. Nav. Res. Logist. 36(1), 27\u201342 (1989)","journal-title":"Nav. Res. Logist."},{"issue":"6","key":"78_CR13","doi-asserted-by":"crossref","first-page":"B427","DOI":"10.1287\/mnsc.16.6.B427","volume":"16","author":"M Bellmore","year":"1970","unstructured":"Bellmore, M., Geenberg, H.J., Jarvis, J.J.: Multi-commodity disconnecting sets. Manage. Sci. 16(6), B427\u2013B433 (1970)","journal-title":"Manage. Sci."},{"key":"78_CR14","doi-asserted-by":"crossref","unstructured":"Bellmore, M., Ratliff, H.D.: Optimal defense of multi-commodity networks. Manage. Sci. 18(4-part-I), B174\u2013B185 (1971)","DOI":"10.1287\/mnsc.18.4.B174"},{"key":"78_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."},{"key":"78_CR16","first-page":"18","volume":"6","author":"ME Salveson","year":"1955","unstructured":"Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6, 18\u201325 (1955)","journal-title":"J. Ind. Eng."},{"issue":"2","key":"78_CR17","doi-asserted-by":"crossref","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."},{"issue":"2","key":"78_CR18","doi-asserted-by":"crossref","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. 81(2), 215\u2013228 (1998)","journal-title":"Math. Program."},{"key":"78_CR19","doi-asserted-by":"crossref","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":"78_CR20","doi-asserted-by":"crossref","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":"3","key":"78_CR21","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/opre.13.3.482","volume":"13","author":"RH Day","year":"1965","unstructured":"Day, R.H.: Letter to the editor\u2014on optimal extracting from a multiple file data storage system: an application of integer programming. Oper. Res. 13(3), 482\u2013494 (1965)","journal-title":"Oper. Res."},{"issue":"8","key":"78_CR22","doi-asserted-by":"crossref","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. Manage. Sci. 16(8), B495\u2013B508 (1970)","journal-title":"Manage. Sci."},{"issue":"5","key":"78_CR23","doi-asserted-by":"crossref","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":"78_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/11779568_34","volume-title":"Advances in Applied Artificial Intelligence","author":"N Musliu","year":"2006","unstructured":"Musliu, N.: Local search algorithm for unicost set covering problem. In: Ali, M., Dapoigny, R. (eds.) IEA\/AIE 2006. LNCS (LNAI), vol. 4031, pp. 302\u2013311. Springer, Heidelberg (2006)"},{"issue":"2","key":"78_CR25","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"ZN Azimi","year":"2010","unstructured":"Azimi, Z.N., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290\u2013300 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"78_CR26","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"78_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00185-7","volume-title":"Music-Inspired Harmony Search Algorithm: Theory and Applications","author":"ZW Geem","year":"2009","unstructured":"Geem, Z.W.: Music-Inspired Harmony Search Algorithm: Theory and Applications, 1st edn. Springer, Heidelberg (2009)","edition":"1"},{"issue":"2","key":"78_CR28","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"key":"78_CR29","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company, Cambridge (2001)","edition":"2"},{"issue":"2","key":"78_CR30","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"MGH Omran","year":"2008","unstructured":"Omran, M.G.H., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198(2), 643\u2013656 (2008)","journal-title":"Appl. Math. Comput."},{"issue":"13","key":"78_CR31","doi-asserted-by":"crossref","first-page":"5788","DOI":"10.1016\/j.eswa.2014.03.016","volume":"41","author":"W Xiang","year":"2014","unstructured":"Xiang, W., An, M., Li, Y., He, R., Zhang, J.: An improved global-best harmony search algorithm for faster optimization. Expert Syst. Appl. 41(13), 5788\u20135803 (2014)","journal-title":"Expert Syst. Appl."},{"key":"78_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-048-3","volume-title":"Probability Theory: A Comprehensive Course","author":"A Klenke","year":"2008","unstructured":"Klenke, A.: Probability Theory: A Comprehensive Course. Springer, London (2008)"},{"key":"78_CR33","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24, 656\u2013667 (1994)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"78_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-642-38715-9_4","volume-title":"Advances in Swarm Intelligence","author":"B 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.) ICSI 2013, Part II. LNCS, vol. 7929, pp. 27\u201334. Springer, Heidelberg (2013)"}],"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_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T21:59:42Z","timestamp":1600898382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42007-3_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420066","9783319420073"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42007-3_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}