Tabu search for covering arrays using permutation vectors

DOI10.1016/j.jspi.2008.05.020zbMath1284.62497OpenAlexW1997301902MaRDI QIDQ953845

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

tabu searchorthogonal arrayheuristic searchcovering arraypermutation vector

Mathematics Subject Classification ID

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

Related Items (19)

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

Uses Software

• Tabu search
• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roux-type constructions for covering arrays of strengths three and four
• Constructing strength three covering arrays with augmented annealing
• Orthogonal arrays. Theory and applications
• Upper bounds for covering arrays by tabu search.
• Problems and algorithms for covering arrays
• On \(t\)-covering arrays
• Genetic and hybrid algorithms for graph coloring
• On the state of strength-three covering arrays
• Covering arrays and intersecting codes
• Perfect Hash Families: Constructions and Existence
• Covering arrays of higher strength from permutation vectors

This page was built for publication: Tabu search for covering arrays using permutation vectors