Constraint models for the covering test problem
From MaRDI portal
Publication:850459
DOI10.1007/s10601-006-7094-9zbMath1103.68810OpenAlexW1995563955MaRDI QIDQ850459
Steven Prestwich, Barbara M. Smith, Brahim Hnich, Evgeny Selensky
Publication date: 3 November 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-006-7094-9
Related Items (22)
A primer on the application of neural networks to covering array generation ⋮ CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Towards breaking more composition symmetries in partial symmetry breaking ⋮ A formal logic approach to constrained combinatorial testing ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Algebraic Modelling of Covering Arrays ⋮ Classification of orthogonal arrays by integer programming ⋮ Randomized post-optimization of covering arrays ⋮ Constraint games for stable and optimal allocation of demands in SDN ⋮ New covering array numbers ⋮ Covering and radius-covering arrays: constructions and classification ⋮ A Logic-Based Approach to Combinatorial Testing with Constraints ⋮ Classifier-based constraint acquisition ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures ⋮ Problems and algorithms for covering arrays via set covers ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays ⋮ Heuristically enhanced IPO algorithms for covering array generation
Uses Software
Cites Work
- Unnamed Item
- Tree clustering for constraint networks
- Increasing constraint propagation by redundant modeling: An experience report
- Upper bounds for covering arrays by tabu search.
- Negative effects of modeling techniques on search performance
- Problems and algorithms for covering arrays
- On the state of strength-three covering arrays
- Vector sets for exhaustive testing of logic circuits
- Group construction of covering arrays
- Covering arrays and intersecting codes
- Recent Advances in Constraints
This page was built for publication: Constraint models for the covering test problem
