On the public citation graph
WCA: A weighting local search for constrained combinatorial test optimization
0 signed · 70 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/stvr.294openalex-snapshot
Search‐based software test data generation: a survey
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.1007/978-3-030-38629-0_5openalex-snapshot
How to Use Boltzmann Machines and Neural Networks for Covering Array Generation
inferredcites →https://doi.org/10.1007/978-3-540-74565-5_31openalex-snapshot
A Stochastic Local Search Approach to Vertex Cover
inferredcites →https://doi.org/10.1007/978-3-642-16242-8_9openalex-snapshot
Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers
inferredcites →https://doi.org/10.1007/s10664-010-9135-7openalex-snapshot
Evaluating improvements to a meta-heuristic search for constrained interaction testing
inferredcites →https://doi.org/10.1007/s10817-005-9010-1openalex-snapshot
Clause Weighting Local Search for SAT
inferredcites →https://doi.org/10.1016/j.artint.2011.03.003openalex-snapshot
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
inferredcites →https://doi.org/10.1016/j.artint.2013.09.001openalex-snapshot
Local search for Boolean Satisfiability with configuration checking and subscore
inferredcites →https://doi.org/10.1016/j.ejc.2012.07.017openalex-snapshot
Randomized post-optimization of covering arrays
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.tcs.2009.07.057openalex-snapshot
Covering arrays avoiding forbidden edges
inferredcites →https://doi.org/10.1016/j.tcs.2011.07.010openalex-snapshot
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
inferredcites →https://doi.org/10.1016/j.tcs.2019.10.019openalex-snapshot
A survey on the state of the art of complexity problems for covering arrays
inferredcites →https://doi.org/10.1016/s0166-218x(03)00291-9openalex-snapshot
Upper bounds for covering arrays by tabu search
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.879426openalex-snapshot
Automating test case generation for the new generation mission software system
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/ase11371.2006openalex-snapshot
21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)
inferredcites →https://doi.org/10.1109/ase34967.2015openalex-snapshot
2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE)
inferredcites →https://doi.org/10.1109/cec.2014.6900355openalex-snapshot
A weighting-based local search heuristic algorithm for the Set Covering Problem
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/fose.2007.29openalex-snapshot
The Current State and Future of Search Based Software Engineering
inferredcites →https://doi.org/10.1109/hase.1998.731623openalex-snapshot
In-parameter-order: a test generation strategy for pairwise testing
inferredcites →https://doi.org/10.1109/icse.2015.71openalex-snapshot
Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search
inferredcites →https://doi.org/10.1109/icst.2013.35openalex-snapshot
An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation
inferredcites →https://doi.org/10.1109/icst.2015.7102599openalex-snapshot
Optimization of Combinatorial Testing by Incremental SAT Solving
inferredcites →https://doi.org/10.1109/ieeeconf10595.2005openalex-snapshot
29th Annual IEEE/NASA Software Engineering Workshop
inferredcites →https://doi.org/10.1109/mci.2014.2369861openalex-snapshot
2015 IEEE Congress on Evolutionary Computation (CEC2015)
inferredcites →https://doi.org/10.1109/sew.2006.26openalex-snapshot
Pseudo-Exhaustive Testing for Software
inferredcites →https://doi.org/10.1109/ssbse.2009.25openalex-snapshot
An Improved Meta-heuristic Search for Constrained Interaction Testing
inferredcites →https://doi.org/10.1109/tc.2014.2346196openalex-snapshot
CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1109/tse.2006.8openalex-snapshot
Covering arrays for efficient fault characterization in complex configuration spaces
inferredcites →https://doi.org/10.1109/tse.2007.38openalex-snapshot
Search Algorithms for Regression Test Case Prioritization
inferredcites →https://doi.org/10.1109/tse.2008.50openalex-snapshot
Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach
inferredcites →https://doi.org/10.1109/tse.2018.2837759openalex-snapshot
CHiP: A Configurable Hybrid Parallel Covering Array Constructor
inferredcites →https://doi.org/10.1145/1062455.1062495openalex-snapshot
A framework of greedy methods for constructing interaction test suites
inferredcites →https://doi.org/10.1145/1068009.1068184openalex-snapshot
An empirical study of the robustness of two module clustering fitness functions
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.1277176openalex-snapshot
Pareto optimal search based refactoring at the design level
inferredcites →https://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferredcites →https://doi.org/10.1145/2970276.2970335openalex-snapshot
Greedy combinatorial test case generation using unsatisfiable cores
inferredcites →https://doi.org/10.1145/3071178.3071324openalex-snapshot
A penalty-based Tabu search for constrained covering arrays
inferredcites →https://doi.org/10.1145/3205455openalex-snapshot
Proceedings of the Genetic and Evolutionary Computation Conference
inferredcites →https://doi.org/10.1609/aaai.v28i1.9109openalex-snapshot
Tailoring Local Search for Partial MaxSAT
inferredcites →https://doi.org/10.1609/aaai.v30i1.10067openalex-snapshot
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
inferredcites →https://doi.org/10.1613/jair.5443openalex-snapshot
Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess
inferredcites →https://doi.org/10.24963/ijcai.2018/187openalex-snapshot
Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10009-024-00745-2openalex-snapshot
State of the CArt: evaluating covering array generators at scale
inferred← citeshttps://doi.org/10.1007/s10489-020-01983-yopenalex-snapshot
More efficient stochastic local search for satisfiability
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/s42452-020-04013-1openalex-snapshot
A novel chaotic manta-ray foraging optimization algorithm for thermo-economic design optimization of an air-fin cooler
inferred← citeshttps://doi.org/10.1016/j.infsof.2021.106768openalex-snapshot
An Adaptive Penalty based Parallel Tabu Search for Constrained Covering Array Generation
inferred← citeshttps://doi.org/10.1016/j.infsof.2026.108255openalex-snapshot
An effective covering array generation algorithm based on rollback and candidate-based test case removal strategies
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104791openalex-snapshot
Effectively computing high strength mixed covering arrays with constraints
inferred← citeshttps://doi.org/10.1049/sfw2.12054openalex-snapshot
A synergic quantum particle swarm optimisation for constrained combinatorial test generation
inferred← citeshttps://doi.org/10.1088/2631-8695/ae39afopenalex-snapshot
Preparation, mechanical properties and cytocompatibility of chemically crosslinked silk fibroin gradient hydrogel
inferred← citeshttps://doi.org/10.1109/icacte66284.2025.11411956openalex-snapshot
An Enhanced Constraint-Based Generator for Automated Combinatorial Testing Flow
inferred← citeshttps://doi.org/10.1109/icse43902.2021.00030openalex-snapshot
AutoCCAG: An Automated Approach to Constrained Covering Array Generation
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00113openalex-snapshot
Towards High-Strength Combinatorial Interaction Testing for Highly Configurable Software Systems
inferred← citeshttps://doi.org/10.1109/icstw55395.2022.00028openalex-snapshot
A Constrained Covering Array Generator using Adaptive Penalty based Parallel Tabu Search
inferred← citeshttps://doi.org/10.1109/icstw64639.2025.10962457openalex-snapshot
A Search-Based Benchmark Generator for Constrained Combinatorial Testing Models
inferred← citeshttps://doi.org/10.1145/3688836openalex-snapshot
Solving the t -Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling
inferred← citeshttps://doi.org/10.1155/2022/7960610openalex-snapshot
An Enhanced Multifactor Multiobjective Approach for Software Modularization
inferred← citeshttps://doi.org/10.21015/vtse.v13i3.2125openalex-snapshot
Systematic Analysis of Search-Based Strategies for Combinatorial Test Suite Construction
inferred← citeshttps://doi.org/10.32604/iasc.2023.032122openalex-snapshot
Implementation of Hybrid Particle Swarm Optimization for Optimized Regression Testing
inferred← citeshttps://doi.org/10.3390/math11204361openalex-snapshot
A Population-Based Local Search Algorithm for the Identifying Code Problem
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.