A greedy-metaheuristic 3-stage approach to construct covering arrays

DOI10.1016/j.ins.2018.05.047zbMath1440.68347OpenAlexW2805417520WikidataQ129760457 ScholiaQ129760457MaRDI QIDQ2198200

Himer Avila-George, Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Brenda Acevedo-Juárez

Publication date: 9 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.05.047

zbMATH Keywords

simulated annealinggreedy algorithmsmetaheuristic algorithmscovering arrayscovering perfect hash families3-stage approach

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Approximation methods and heuristics in mathematical programming (90C59) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (4)

Covering array EXtender ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Improved covering arrays using covering perfect hash families with groups of restricted entries ⋮ In-parameter-order strategies for covering perfect hash families

Cites Work

• A two-stage algorithm for combinatorial testing
• Partial covering arrays: algorithms and asymptotics
• Tabu search for covering arrays using permutation vectors
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Strength two covering arrays: existence tables and projection
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Products of mixed covering arrays of strength two
• Covering arrays of higher strength from permutation vectors
• Orthogonal Arrays of Index Unity

This page was built for publication: A greedy-metaheuristic 3-stage approach to construct covering arrays