CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH

DOI10.1142/S1793830912500334zbMath1315.68108MaRDI QIDQ3166745

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

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

tabu searchsoftware testingmixed covering arrays

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Combinatorics in computer science (68R05) Orthogonal arrays, Latin squares, Room squares (05B15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of software (68N99)

Related Items (2)

Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search ⋮ Algebraic Modelling of Covering Arrays

Cites Work

• A survey of methods for constructing covering arrays
• Constraint models for the covering test problem
• Tabu search for covering arrays using permutation vectors
• Upper bounds for covering arrays by tabu search.

This page was built for publication: CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH