{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:48:31Z","timestamp":1764686911411,"version":"3.46.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s11704-025-40570-7","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:44:50Z","timestamp":1764686690000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GenSC: a novel and general local search framework for set covering problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Chuan","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taoyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"issue":"2","key":"40570_CR1","doi-asserted-by":"publisher","first-page":"122101","DOI":"10.1007\/s11432-023-3900-7","volume":"68","author":"C Liu","year":"2025","unstructured":"Liu C, Liu G, Luo C, Cai S, Lei Z, Zhang W, Chu Y, Zhang G. Optimizing local search-based partial MaxSAT solving via initial assignment prediction. Science China Information Sciences, 2025, 68(2): 122101","journal-title":"Science China Information Sciences"},{"key":"40570_CR2","first-page":"1569","volume-title":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","author":"Z Lei","year":"2020","unstructured":"Lei Z, Cai S. Solving set cover and dominating set via maximum satisfiability. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence. 2020, 1569\u20131576"},{"issue":"3","key":"40570_CR3","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TCYB.2022.3199147","volume":"54","author":"C Luo","year":"2024","unstructured":"Luo C, Xing W, Cai S, Hu C. NuSC: an effective local search algorithm for solving the set covering problem. IEEE Transactions on Cybernetics, 2024, 54(3): 1403\u20131416","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"2","key":"40570_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"H H Hoos","year":"2012","unstructured":"Hoos H H. Programming by optimization. Communications of the ACM, 2012, 55(2): 70\u201380","journal-title":"Communications of the ACM"},{"key":"40570_CR5","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing-SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins R, Manquinho V, Lynce I. Open-WBO: a modular MaxSAT solver. In: Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing-SAT 2014. 2014, 438\u2013445"},{"key":"40570_CR6","first-page":"39","volume-title":"Proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"J Berg","year":"2019","unstructured":"Berg J, Demirovi\u0107 E, Stuckey P J. Core-boosted linear search for incomplete MaxSAT. In: Proceedings of the 16th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. 2019, 39\u201356"},{"key":"40570_CR7","doi-asserted-by":"publisher","first-page":"103354","DOI":"10.1016\/j.artint.2020.103354","volume":"287","author":"S Cai","year":"2020","unstructured":"Cai S, Lei Z. Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artificial Intelligence, 2020, 287: 103354","journal-title":"Artificial Intelligence"},{"key":"40570_CR8","first-page":"507","volume-title":"Proceedings of the 5th International Conference on Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter F, Hoos H H, Leyton-Brown K. Sequential model-based optimization for general algorithm configuration. In: Proceedings of the 5th International Conference on Learning and Intelligent Optimization. 2011, 507\u2013523"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-40570-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-40570-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-40570-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:44:51Z","timestamp":1764686691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-40570-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["40570"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-40570-7","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"5 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2005404"}}