Minimum Vertex Cover Problem (MVCP) is a combinatorial optimization problem that is
utilized to formulate multiple real-life applications. Owing to this fact, abundant research has …

Today's academics have a major hurdle in solving combinatorial problems in the actual
world. It is nevertheless possible to use optimization techniques to find, design, and solve a …

This paper discusses the construction of a test data generation strategy for variable strength
covering array (VSCA). The complexity of a VSCA strategy affects the scalability to support …

Although t-way strategy tries to generate a minimum test suite (TS) for detecting errors in
software systems, its functionality is affected by three important challenges. The first one …

The research focus in the field of combinatorial testing has shifted from unconstrained
covering array generation (CAG) to constrained covering array generation (CCAG). Most …

Combinatorial testing (CT) is an effective testing method that can detect failures caused by
the interaction of parameters of the software under test (SUT). With the increasing complexity …

Abstract t-way interaction testing is a systematic approach for exhaustive test set generation.
It is a vital test planning method in software testing, which generates test sets based on …

Covering array generation (CAG) is the key research problem in combinatorial testing and is
an NP‐complete problem. With the increasing complexity of software under test and the …

Scheduling is a key decision-making process within the industrial manufacturing sectors.
Effective scheduling is crucial for enhancing the company's key performance indicators and …

In software testing, test case generation is the most challenging activities and expensive
tasks. Where has a considerable impact on the ability to produce a desired or intended …