GenSC: a novel and general local search framework for set covering problem

References

[1] 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

[2] 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−1576

[3] 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–1416

[4] Hoos H H . Programming by optimization. Communications of the ACM, 2012, 55( 2): 70–80

[5] 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−445

[6] Berg J, Demirović 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−56

[7] Cai S, Lei Z . Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artificial Intelligence, 2020, 287: 103354

[8] 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−523

RIGHTS & PERMISSIONS

Higher Education Press