Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation

• Main Authors: Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.
• Format: Article
• Language: English
• Published: Institution of Engineering and Technology 2018
• Subjects: QA75 Electronic computers. Computer science; QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/23683/7/Adapting%20the%20elitism%20on%20greedy%20algorithm-INPress1.pdf; http://umpir.ump.edu.my/id/eprint/23683/; https://doi.org/10.1049/iet-sen.2018.5005; https://doi.org/10.1049/iet-sen.2018.5005

A combinatorial testing (CT) is an important technique usually employed in the generation of test cases. The generation of an optimal sized test case is a Non-Deterministic Polynomial hard problem (NP). In recent times, many researchers had developed the various strategies based on the search-based...