Tabu search for covering arrays using permutation vectors

DOI10.1016/J.JSPI.2008.05.020MaRDI QIDQ953845zbMATHOpenAlexFDO

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

zbMATH Keywords

heuristic searchorthogonal arraytabu searchcovering arraypermutation vector

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Design of statistical experiments (62K99)

Recommendations

• Upper bounds for covering arrays by tabu search.
• Covering arrays of strength three from extended permutation vectors
• Covering arrays of higher strength from permutation vectors

Cites work

• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Constructing strength three covering arrays with augmented annealing
• Covering arrays and intersecting codes
• Covering arrays of higher strength from permutation vectors
• Genetic and hybrid algorithms for graph coloring
• On \(t\)-covering arrays
• On the state of strength-three covering arrays
• Orthogonal arrays. Theory and applications
• Perfect Hash Families: Constructions and Existence
• Problems and algorithms for covering arrays
• Recursive constructions of covering arrays
• Roux-type constructions for covering arrays of strengths three and four
• Software and hardware testing using combinatorial covering suites
• Upper bounds for covering arrays by tabu search.

Cited in

(21)

• Arrays for combinatorial interaction testing: a review on constructive approaches
• Locating and detecting arrays for interaction faults
• Randomized post-optimization of covering arrays
• Improved covering arrays using covering perfect hash families with groups of restricted entries
• CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
• Upper bounds on the size of covering arrays
• Binary Covering Arrays and Existentially Closed Graphs
• An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs
• Upper bounds for covering arrays by tabu search.
• A greedy-metaheuristic 3-stage approach to construct covering arrays
• Covering arrays of higher strength from permutation vectors
• Covering and radius-covering arrays: constructions and classification
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
• In-parameter-order strategies for covering perfect hash families
• Covering arrays, augmentation, and quilting arrays
• Covering array EXtender
• A two-stage algorithm for combinatorial testing
• Subspace restrictions and affine composition for covering perfect hash families
• Covering arrays of strength three from extended permutation vectors
• An extension of a construction of covering arrays

Describes a project that uses

Uses Software

• Tabu search
• AETG

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)