The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …

The minimum weight dominating set (MWDS) problem is NP-hard and also important in
many applications. Recent heuristic MWDS algorithms can hardly solve massive real world …

The minimum weight dominating set (MWDS) problem is an important generalization of the
minimum dominating set problem with various applications. In this work, we develop an …

Aero-engine nacelle acoustic liners are complex curved surface subassemblies with tens of
thousands of dense acoustic holes for noise reduction. Traditional robotic drilling systems …

Context Covering array generation (CAG) is the core task of Combinatorial interaction
testing (CIT), which is widely used to discover interaction faults in real-world systems …

With the rapid development of remote sensing technology, remote sensing products have
found increasingly widespread applications across various fields. Nevertheless, as the …

Abstract The Set Covering Problem (SCP) and Dominating Set Problem (DSP) are NP-hard
and have many real world applications. SCP and DSP can be encoded into Maximum …

The partial set covering problem (PSCP) is a significant combinatorial optimization problem
that finds applications in numerous real-world scenarios. The objective of PSCP is to …

Combinatorial auction, which allows bidders to bid on combinations of items, is an important
type of market mechanism. The winner determination problem (WDP) has extensive …

The set k‐covering problem (SKCP) is NP‐hard and has important real‐world applications.
In this paper, we propose several improvements over typical algorithms for its solution. First …