{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T15:26:41Z","timestamp":1726068401809},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030419127"},{"type":"electronic","value":"9783030419134"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41913-4_9","type":"book-chapter","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T19:04:50Z","timestamp":1581707090000},"page":"98-112","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Heuristic Algorithm for the Set k-Cover Problem"],"prefix":"10.1007","author":[{"given":"Amir","family":"Salehipour","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0305-0548(81)90017-4","volume":"8","author":"EK Baker","year":"1981","unstructured":"Baker, E.K.: Efficient heuristic algorithms for the weighted set covering problem. Comput. Oper. Res. 8(4), 303\u2013310 (1981)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9_CR2","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. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"key":"9_CR3","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0120886","volume-title":"Combinatorial Optimization","author":"E Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol. 12, pp. 37\u201360. Springer, Heidelberg (1980). \nhttps:\/\/doi.org\/10.1007\/BFb0120886"},{"issue":"10","key":"9_CR4","doi-asserted-by":"publisher","first-page":"3162","DOI":"10.1016\/j.cor.2005.11.026","volume":"34","author":"J Bautista","year":"2007","unstructured":"Bautista, J., Pereira, J.: A GRASP algorithm to solve the unicost set covering problem. Comput. Oper. Res. 34(10), 3162\u20133173 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","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":"1","key":"9_CR6","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":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A Lagrangian heuristic for set-covering problems. Nav. Res. Logist. 37(1), 151\u2013164 (1990)","journal-title":"Nav. Res. Logist."},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","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."},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"J Beasley","year":"1992","unstructured":"Beasley, J., J\u00f8rnsten, K.: Practical combinatorial optimization enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293\u2013300 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9_CR9","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. 47(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"9_CR10","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. 98(1\u20134), 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9_CR11","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.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. ORSIS, vol. 39, pp. 43\u201363. Springer, Boston (2007). \nhttps:\/\/doi.org\/10.1007\/978-0-387-71921-4_3"},{"issue":"2","key":"9_CR12","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. 81(2), 215\u2013228 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9_CR13","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. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Manag. Sci. 36(6), 674\u2013688 (1990)","journal-title":"Manag. Sci."},{"key":"9_CR16","volume-title":"Integer Programming","author":"RS Garfinkel","year":"1972","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Integer Programming. Wiley, New York (1972)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(96)00050-1","volume":"97","author":"S Haddadi","year":"1997","unstructured":"Haddadi, S.: Simple Lagrangian heuristic for the set covering problem. Eur. J. Oper. Res. 97(1), 200\u2013204 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"26-28","key":"9_CR18","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1016\/j.tcs.2010.02.016","volume":"411","author":"Q-S Hua","year":"2010","unstructured":"Hua, Q.-S., Wang, Y., Yu, D., Lau, F.C.: Dynamic programming based algorithms for set multicover and multiset multicover problems. Theoret. Comput. Sci. 411(26-28), 2467\u20132474 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan, G., DePuy, G.W., Whitehouse, G.E.: An effiective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176(3), 1387\u20131403 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discret. Math. 13(4), 383\u2013390 (1975)","journal-title":"Discret. Math."},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi, Z., 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":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11590-011-0312-4","volume":"5","author":"LS Pessoa","year":"2011","unstructured":"Pessoa, L.S., Resende, M.G.C., Ribeiro, C.C.: Experiments with LAGRASP heuristic for set k-covering. Optim. Lett. 5(3), 407\u2013419 (2011)","journal-title":"Optim. Lett."},{"issue":"12","key":"9_CR23","doi-asserted-by":"publisher","first-page":"3132","DOI":"10.1016\/j.cor.2011.11.018","volume":"40","author":"LS Pessoa","year":"2013","unstructured":"Pessoa, L.S., Resende, M.G.C., Ribeiro, C.C.: A hybrid Lagrangean heuristic with GRASP and path-relinking for set K-covering. Comput. Oper. Res. 40(12), 3132\u20133146 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/nav.3800310118","volume":"31","author":"FJ Vasko","year":"1984","unstructured":"Vasko, F.J.: An efficient heuristic for large set covering problems. Nav. Res. Logist. Q. 31(1), 163\u2013171 (1984)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/nav.3800330207","volume":"33","author":"FJ Vasko","year":"1986","unstructured":"Vasko, F.J., Wilson, G.R.: Hybrid heuristics for minimum cardinality set covering problems. Nav. Res. Logist. Q. 33(2), 241\u2013249 (1986)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","volume":"172","author":"M Yagiura","year":"2006","unstructured":"Yagiura, M., Kishida, M., Ibaraki, T.: A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172(2), 472\u2013499 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41913-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T19:10:46Z","timestamp":1581707446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41913-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030419127","9783030419134"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41913-4_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"C\u00e1diz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}