NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem-Reference-Cited by-同舟云学术

NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem

Published:2022 Issue: Volume: Page:1-14
ISSN:2168-2267
Container-title:IEEE Transactions on Cybernetics
language:
Short-container-title:IEEE Trans. Cybern.

Author:

Luo Chuan¹^ORCID,Xing Wenqian²^ORCID,Cai Shaowei³^ORCID,Hu Chunming¹^ORCID

Affiliation:

1. School of Software, Beihang University, Beijing, China

2. Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA

3. Institute of Software, State Key Laboratory of Computer Science, Chinese Academy of Sciences, Beijing, China

Funder

National Natural Science Foundation of China

Natural Science Foundation of Changsha

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Science Applications,Human-Computer Interaction,Information Systems,Control and Systems Engineering,Software

Link

http://xplorestaging.ieee.org/ielx7/6221036/6352949/09877844.pdf?arnumber=9877844

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Beyond Pairwise Testing: Advancing 3-wise Combinatorial Interaction Testing for Highly Configurable Systems;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11

2. Solving the t -wise Coverage Maximum Problem via Effective and Efficient Local Search-based Sampling;ACM Transactions on Software Engineering and Methodology;2024-08-16

3. HSMVS: heuristic search for minimum vertex separator on massive graphs;PeerJ Computer Science;2024-05-17

4. A four-stage branch local search algorithm for minimal test cost attribute reduction based on the set covering;Applied Soft Computing;2024-03

5. Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications;IEEE Transactions on Cybernetics;2024