MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays

DOI10.1007/978-3-642-29694-9_15zbMath1277.68248OpenAlexW2096316774MaRDI QIDQ2866118

Nelson Rangel-Valdez, Loreto Gonzalez-Hernandez, Jose Torres-Jimenez

Publication date: 13 December 2013

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_15

zbMATH Keywords

MCAPmixed covering array problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of binary covering arrays
• A survey of methods for constructing covering arrays
• Constraint models for the covering test problem
• Roux-type constructions for covering arrays of strengths three and four
• Tabu search for covering arrays using permutation vectors
• Constructions of new orthogonal arrays and covering arrays of strength three
• Covering arrays from cyclotomy
• Upper bounds for covering arrays by tabu search.
• Problems and algorithms for covering arrays
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• A survey of combinatorial testing
• Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
• Randomized Postoptimization of Covering Arrays
• Practical Software Testing
• Products of mixed covering arrays of strength two
• Orthogonal Arrays of Index Unity

This page was built for publication: MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays