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

DOI10.1016/j.ins.2018.05.047zbMath1440.68347MaRDI 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 annealing; greedy algorithms; metaheuristic algorithms; covering arrays; covering perfect hash families; 3-stage approach

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R05: Combinatorics in computer science

90C59: Approximation methods and heuristics in mathematical programming

05B15: Orthogonal arrays, Latin squares, Room squares

Related Items

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

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