Tabu search for covering arrays using permutation vectors
From MaRDI portal
Publication:953845
DOI10.1016/J.JSPI.2008.05.020zbMATH Open1284.62497OpenAlexW1997301902MaRDI QIDQ953845FDOQ953845
Authors: Robert A. II Walker, Charles J. Colbourn 
Publication date: 6 November 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2008.05.020
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Design of statistical experiments (62K99)
Cites Work
- Title not available (Why is that?)
- Orthogonal arrays. Theory and applications
- Problems and algorithms for covering arrays
- Covering arrays and intersecting codes
- Perfect Hash Families: Constructions and Existence
- Genetic and hybrid algorithms for graph coloring
- On \(t\)-covering arrays
- On the state of strength-three covering arrays
- Software and hardware testing using combinatorial covering suites
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Upper bounds for covering arrays by tabu search.
- Covering arrays of higher strength from permutation vectors
- Recursive constructions of covering arrays
Cited In (21)
- Binary Covering Arrays and Existentially Closed Graphs
- Covering and radius-covering arrays: constructions and classification
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Upper Bounds on the Size of Covering Arrays
- Covering array EXtender
- An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
- Covering arrays, augmentation, and quilting arrays
- Subspace restrictions and affine composition for covering perfect hash families
- An extension of a construction of covering arrays
- Locating and detecting arrays for interaction faults
- Covering arrays of strength three from extended permutation vectors
- Upper bounds for covering arrays by tabu search.
- Randomized post-optimization of covering arrays
- Arrays for combinatorial interaction testing: a review on constructive approaches
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- Improved covering arrays using covering perfect hash families with groups of restricted entries
- Covering arrays of higher strength from permutation vectors
- In-parameter-order strategies for covering perfect hash families
- A two-stage algorithm for combinatorial testing
Uses Software
This page was built for publication: Tabu search for covering arrays using permutation vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953845)
