On the public citation graph
A tuned version of genetic algorithm for efficient test suite generation in interactive t -way testing strategy
0 signed · 108 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/qre.1934openalex-snapshot
An Optimal Solution for Test Case Generation Using ROBDD Graph and PSO Algorithm
inferredcites →https://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
inferredcites →https://doi.org/10.1002/stvr.381openalex-snapshot
IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing
inferredcites →https://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferredcites →https://doi.org/10.1007/0-387-25036-0_10openalex-snapshot
Software and Hardware Testing Using Combinatorial Covering Suites
inferredcites →https://doi.org/10.1007/978-0-387-35516-0_4openalex-snapshot
Determination of Test Configurations for Pair-Wise Interaction Coverage
inferredcites →https://doi.org/10.1007/978-3-319-17530-0_16openalex-snapshot
tReductSA – Test Redundancy Reduction Strategy Based on Simulated Annealing
inferredcites →https://doi.org/10.1007/978-3-642-39742-4_27openalex-snapshot
An Approach to Test Set Generation for Pair-Wise Testing Using Genetic Algorithms
inferredcites →https://doi.org/10.1007/s13369-015-2022-1openalex-snapshot
Construction of Mixed Covering Arrays for Pair-wise Testing Using Probabilistic Approach in Genetic Algorithm
inferredcites →https://doi.org/10.1016/j.asoc.2011.11.029openalex-snapshot
Application of Particle Swarm Optimization to uniform and variable strength covering array construction
inferredcites →https://doi.org/10.1016/j.asoc.2014.06.055openalex-snapshot
A heuristic solution for model checking graph transformation systems
inferredcites →https://doi.org/10.1016/j.asoc.2016.03.021openalex-snapshot
A Tabu Search hyper-heuristic strategy for t-way test suite generation
inferredcites →https://doi.org/10.1016/j.disc.2006.06.036openalex-snapshot
Constructing strength three covering arrays with augmented annealing
inferredcites →https://doi.org/10.1016/j.eswa.2015.07.029openalex-snapshot
An efficient strategy for covering array construction with fuzzy logic-based adaptive swarm optimization for software testing use
inferredcites →https://doi.org/10.1016/j.infsof.2008.12.005openalex-snapshot
A systematic review of search-based testing for non-functional system properties
inferredcites →https://doi.org/10.1016/j.infsof.2012.01.002openalex-snapshot
Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support
inferredcites →https://doi.org/10.1016/j.infsof.2015.05.005openalex-snapshot
Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm
inferredcites →https://doi.org/10.1016/j.ins.2011.01.002openalex-snapshot
Design and implementation of a t-way test data generation strategy with automated execution tool support
inferredcites →https://doi.org/10.1016/j.jss.2011.06.004openalex-snapshot
A variable strength interaction test suites generation strategy using Particle Swarm Optimization
inferredcites →https://doi.org/10.1016/j.jss.2014.09.001openalex-snapshot
Generating combinatorial test suite using combinatorial optimization
inferredcites →https://doi.org/10.1016/j.jvlc.2012.12.002openalex-snapshot
Scenario-driven analysis of systems specified through graph transformations
inferredcites →https://doi.org/10.1109/32.605761openalex-snapshot
The AETG system: an approach to testing based on combinatorial design
inferredcites →https://doi.org/10.1109/aero.2000.879266openalex-snapshot
2000 IEEE Aerospace Conference
inferredcites →https://doi.org/10.1109/apsec.2004.99openalex-snapshot
Proceedings. 11th Asia-Pacific Software Engineering Conference
inferredcites →https://doi.org/10.1109/apsec.2009.18openalex-snapshot
Variable Strength Interaction Testing with an Ant Colony System Approach
inferredcites →https://doi.org/10.1109/ase.2015.61openalex-snapshot
TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T)
inferredcites →https://doi.org/10.1109/cmpsac.2003.1245373openalex-snapshot
A variable strength interaction testing of components
inferredcites →https://doi.org/10.1109/cmpsac.2004.1342808openalex-snapshot
Using arti .cial lifetechniques to generatetest cases forcombinatorial testing
inferredcites →https://doi.org/10.1109/compsac.2005.6openalex-snapshot
Proceedings of the 29th Annual International Computer Software and Applications Conference (COMPSAC 2005)
inferredcites →https://doi.org/10.1109/csae.2011.5952610openalex-snapshot
PWiseGen: Generating test cases for pairwise testing using genetic algorithms
inferredcites →https://doi.org/10.1109/csae19726.2012openalex-snapshot
2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE)
inferredcites →https://doi.org/10.1109/ecbs.2007.47openalex-snapshot
IPOG: A General Strategy for T-Way Software Testing
inferredcites →https://doi.org/10.1109/iccsce.2015.7482175openalex-snapshot
Assessing optimization based strategies for t-way test suite generation: The case for flower-based strategy
inferredcites →https://doi.org/10.1109/icsecs.2015.7333100openalex-snapshot
SPLBA: An interaction strategy for testing software product lines using the Bat-inspired algorithm
inferredcites →https://doi.org/10.1109/icstw.2009.7openalex-snapshot
IPO-s: Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering Arrays
inferredcites →https://doi.org/10.1109/isiea.2011.6108775openalex-snapshot
Interaction test data generation using Harmony Search Algorithm
inferredcites →https://doi.org/10.1109/isiea16576.2010openalex-snapshot
2010 IEEE Symposium on Industrial Electronics and Applications (ISIEA)
inferredcites →https://doi.org/10.1109/issre.2005.23openalex-snapshot
Improved Test Generation Algorithms for Pair-Wise Testing
inferredcites →https://doi.org/10.1109/itng.2010.93openalex-snapshot
An Empirical Study of Pairwise Test Set Generation Using a Genetic Algorithm
inferredcites →https://doi.org/10.1109/qsic.2003.1319089openalex-snapshot
Generating, selecting and prioritizing test cases from specifications with tool support
inferredcites →https://doi.org/10.1109/qsic.2008.52openalex-snapshot
Greedy Heuristic Algorithms to Generate Variable Strength Combinatorial Test Suite
inferredcites →https://doi.org/10.1109/scored.2015.7449424openalex-snapshot
Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm
inferredcites →https://doi.org/10.1109/scored37524.2015openalex-snapshot
2015 IEEE Student Conference on Research and Development (SCOReD)
inferredcites →https://doi.org/10.1109/tevc.2014.2362532openalex-snapshot
A Discrete Particle Swarm Optimization for Covering Array Generation
inferredcites →https://doi.org/10.1145/1007512openalex-snapshot
Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
inferredcites →https://doi.org/10.1145/1007512.1007519openalex-snapshot
Covering arrays for efficient fault characterization in complex configuration spaces
inferredcites →https://doi.org/10.1145/1273463.1273482openalex-snapshot
Interaction testing of highly-configurable systems in the presence of constraints
inferredcites →https://doi.org/10.1145/1276958.1277173openalex-snapshot
One-test-at-a-time heuristic search for interaction test suites
inferredcites →https://doi.org/10.1145/1389095openalex-snapshot
Proceedings of the 10th annual conference on Genetic and evolutionary computation
inferredcites →https://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferredcites →https://doi.org/10.1162/evco.1993.1.1.25openalex-snapshot
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
inferredcites →https://doi.org/10.5277/e-inf150107openalex-snapshot
Construction of Variable Strength Covering Array for Combinatorial Testing Using a Greedy Approach to Genetic Algorithm
inferredcites →https://doi.org/10.6028/jres.113.022openalex-snapshot
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
inferredcites →https://doi.org/10.7551/mitpress/3927.001.0001openalex-snapshot
An Introduction to Genetic Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/smr.2537openalex-snapshot
A novel combinatorial testing approach with fuzzing strategy
inferred← citeshttps://doi.org/10.1007/978-3-030-19807-7_19openalex-snapshot
Hybrid Artificial Bee Colony Algorithm for t-Way Interaction Test Suite Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-28957-7_14openalex-snapshot
A Model-Driven Approach for Simplified Cluster Based Test Suite Optimization of Industrial Systems – An Introduction to UMLTSO
inferred← citeshttps://doi.org/10.1007/978-3-030-52856-0_12openalex-snapshot
T-way Strategy for (Sequence Less Input Interaction) Test Case Generation Inspired by Fish Swarm Searching Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-16-2183-3_100openalex-snapshot
Recent t-way Test Generation Strategies Based on Optimization Algorithms: An Orchestrated Survey
inferred← citeshttps://doi.org/10.1007/978-981-99-2921-4_39openalex-snapshot
Optimal Design of Garden Landscape Space Environment Based on Interactive Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/s00500-021-05788-0openalex-snapshot
GALP: a hybrid artificial intelligence algorithm for generating covering array
inferred← citeshttps://doi.org/10.1007/s00500-023-08199-5openalex-snapshot
A three-phase approach to improve the functionality of t-way strategy
inferred← citeshttps://doi.org/10.1007/s00521-023-09000-2openalex-snapshot
Q-learning whale optimization algorithm for test suite generation with constraints support
inferred← citeshttps://doi.org/10.1007/s10462-023-10686-yopenalex-snapshot
Automatic program bug fixing by focusing on finding the shortest sequence of changes
inferred← citeshttps://doi.org/10.1007/s11219-021-09582-xopenalex-snapshot
Experience report on the application of genetic algorithms to reduce costs of the software validation process in the automotive sector during an engine control unit project
inferred← citeshttps://doi.org/10.1007/s12293-023-00392-1openalex-snapshot
A tolerance-based memetic algorithm for constrained covering array generation
inferred← citeshttps://doi.org/10.1007/s12652-022-03765-5openalex-snapshot
City councils evolution: a socio-inspired metaheuristic optimization algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106219openalex-snapshot
Extracting Combinatorial Test parameters and their values using model checking and evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.111070openalex-snapshot
Combinatorial t-way test suite generation using an improved asexual reproduction optimization algorithm
inferred← citeshttps://doi.org/10.1016/j.jksuci.2022.11.010openalex-snapshot
SCIPOG: Seeding and constraint support in IPOG strategy for combinatorial t-way testing to generate optimum test cases
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.019openalex-snapshot
A survey on the state of the art of complexity problems for covering arrays
inferred← citeshttps://doi.org/10.1049/sfw2.12138openalex-snapshot
A memetic algorithm for high‐strength covering array generation
inferred← citeshttps://doi.org/10.1063/5.0044617openalex-snapshot
A uniform strength t-way test suite generator based on ant colony optimization algorithm to produce minimum test suite size
inferred← citeshttps://doi.org/10.1088/1742-6596/1529/4/042068openalex-snapshot
A Hybrid Artificial Bee Colony Strategy for t-way Test Set Generation with Constraints Support
inferred← citeshttps://doi.org/10.1088/1742-6596/1755/1/012034openalex-snapshot
T-way Test Suite Generation Strategy based on Ant Colony Algorithm to Support T-way Variable Strength
inferred← citeshttps://doi.org/10.1088/1742-6596/1830/1/012013openalex-snapshot
Hybrid Migrating Birds Optimization Strategy for t-way Test Suite Generation
inferred← citeshttps://doi.org/10.1109/access.2018.2879638openalex-snapshot
An Empirical Comparison of Fixed-Strength and Mixed-Strength for Interaction Coverage Based Prioritization
inferred← citeshttps://doi.org/10.1109/access.2019.2926384openalex-snapshot
A Comprehensive Investigation of Modern Test Suite Optimization Trends, Tools and Techniques
inferred← citeshttps://doi.org/10.1109/access.2020.2995765openalex-snapshot
User Preference Adaptive Fitness of Interactive Genetic Algorithm Based Ceramic Disk Pattern Generation Method
inferred← citeshttps://doi.org/10.1109/access.2020.3032851openalex-snapshot
Combinatorial Test Suites Generation Strategy Utilizing the Whale Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/access.2022.3188856openalex-snapshot
Construction of Prioritized T-Way Test Suite Using Bi-Objective Dragonfly Algorithm
inferred← citeshttps://doi.org/10.1109/access.2025.3583176openalex-snapshot
Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/access.2026.3666942openalex-snapshot
HOS: A Hybrid Metaheuristic One-Parameter-at-a-Time Strategy for T-Way Test Case Generation
inferred← citeshttps://doi.org/10.1109/itss-ioe53029.2021.9615325openalex-snapshot
Nomadic People Optimizer for IoT Combinatorial Testing Problem
inferred← citeshttps://doi.org/10.1109/kse.2019.8919456openalex-snapshot
A Combinatorial Technique for Mobile Applications Software Testing
inferred← citeshttps://doi.org/10.1109/scored.2019.8896324openalex-snapshot
PhABC: A Hybrid Artificial Bee Colony Strategy for Pairwise test suite Generation with Constraints Support
inferred← citeshttps://doi.org/10.1109/tse.2021.3065950openalex-snapshot
Combinatorial Test Generation for Multiple Input Models With Shared Parameters
inferred← citeshttps://doi.org/10.1109/tse.2023.3306461openalex-snapshot
An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing
inferred← citeshttps://doi.org/10.11113/ijic.v14n1.468openalex-snapshot
Ontology-based Negative Selection Algorithm For Pairwise Testing
inferred← citeshttps://doi.org/10.1145/3305160.3305186openalex-snapshot
Literature Review on Test Case Generation Approach
inferred← citeshttps://doi.org/10.1145/3412953.3412970openalex-snapshot
A Kidney Algorithm with Elitism for Combinatorial Testing Problem
inferred← citeshttps://doi.org/10.1155/2018/1860673openalex-snapshot
A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families
inferred← citeshttps://doi.org/10.1155/acis/2108076openalex-snapshot
A 2‐Dimensional Search Space Representation for Combinatorial T‐Way Test Suite Generator Using the Whale Optimization Algorithm
inferred← citeshttps://doi.org/10.1371/journal.pone.0242708openalex-snapshot
Multi-objective regression test suite optimization using three variants of adaptive neuro fuzzy inference system
inferred← citeshttps://doi.org/10.14569/ijacsa.2019.0100431openalex-snapshot
ABCVS: An Artificial Bee Colony for Generating Variable T-Way Test Sets
inferred← citeshttps://doi.org/10.17981/ingecuc.18.2.2022.18openalex-snapshot
Metaheuristic algorithm for the construction of mixed covering arrays of different strength levels to be used in the design of black box software test cases
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3195308/v1openalex-snapshot
Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3195308/v2openalex-snapshot
Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3706348/v1openalex-snapshot
Automated Generation of Covering Array Using Model Checking and Modified Gravitational Search Algorithm
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3706348/v2openalex-snapshot
Automated Generation of Covering Array Using Gravitational Search Algorithm and Biogeography Based Optimization
inferred← citeshttps://doi.org/10.24003/emitter.v13i2.979openalex-snapshot
Enhanced Wingsuit Flying Search (EWFS) Algorithm for Combinatorial T-way Test Suite Generation
inferred← citeshttps://doi.org/10.32604/cmc.2022.026310openalex-snapshot
Whale Optimization Algorithm Strategies for Higher Interaction Strength T-Way Testing
inferred← citeshttps://doi.org/10.32890/jict.20.1.2021.11898openalex-snapshot
DYNAMIC PROBABILITY SELECTION FOR FLOWER POLLINATION ALGORITHM BASED ON METROPOLISHASTINGS CRITERIA
inferred← citeshttps://doi.org/10.3390/app10207264openalex-snapshot
Analyzing the Performance of the Multiple-Searching Genetic Algorithm to Generate Test Cases
inferred← citeshttps://doi.org/10.47836/injet.11.2.04openalex-snapshot
Data Analysis Skills Among Final-Year University Students: Levels, Facilitating Factors, and Obstacles
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.