Pages that link to "Item:Q850459"
From MaRDI portal
The following pages link to Constraint models for the covering test problem (Q850459):
Displayed 21 items.
- A formal logic approach to constrained combinatorial testing (Q616856) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Towards breaking more composition symmetries in partial symmetry breaking (Q1677433) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- New covering array numbers (Q2010732) (← links)
- Classifier-based constraint acquisition (Q2043441) (← links)
- Heuristically enhanced IPO algorithms for covering array generation (Q2115896) (← links)
- \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH (Q3166745) (← links)
- Algebraic Modelling of Covering Arrays (Q4610003) (← links)
- A primer on the application of neural networks to covering array generation (Q5043857) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- A Logic-Based Approach to Combinatorial Testing with Constraints (Q5458811) (← links)