计算机工程与应用2026，Vol.62Issue(8)：1-20,20.DOI:10.3778/j.issn.1002-8331.2507-0352
集合覆盖问题:算法与应用
Set Covering Problem:Algorithms and Applications
摘要
Abstract
The set covering problem,as a core foundational problem in combinatorial optimization,due to its NP-hard complexity,is widely applied in engineering fields such as wireless network base station deployment and logistics routing,and has significant practical application value.In recent years,research on algorithms for solving this problem has advanced continuously,primarily including heuristic algorithms,swarm intelligence optimization algorithms,evolu-tionary algorithms,machine learning,and application-specific algorithms.This paper systematically reviews the research sta-tus and algorithmic development of the set covering problem,focusing on aspects such as algorithm design principles,structural adaptability,and performance comparisons.It summarizes the advantages and limitations of various algorithms,categorizes their applicable scenarios,and discusses the development trends.Furthermore,the paper looks ahead to the re-search directions for the set covering problem in large-scale datasets,aiming to provide theoretical support and method-ological guidance for related research.关键词
集合覆盖问题(SCP)/群智能优化算法/进化算法/启发式算法/机器学习Key words
set covering problem(SCP)/swarm intelligence optimization algorithms/evolutionary algorithms/heuristic algorithms/machine learning分类
信息技术与安全科学引用本文复制引用
锁小娜,王晓峰,颜冬,胡思敏,宋家欢..集合覆盖问题:算法与应用[J].计算机工程与应用,2026,62(8):1-20,20.基金项目
国家自然科学基金(62062001) （62062001）
宁夏自然科学基金(2024AAC03165,2024AAC03169) （2024AAC03165,2024AAC03169）
宁夏青年拔尖人才项目(2021). （2021）
