Mixed optimization combinatorial method for constructing covering arrays

DOI10.1134/S036176881401006XMaRDI QIDQ2017763zbMATH OpenFDO

Authors A. A. Petukhov

Publication date 23 March 2015

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S036176881401006X

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Orthogonal arrays, Latin squares, Room squares (05B15) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• A survey of methods for constructing covering arrays
• Randomized postoptimization of covering arrays
• Randomized post-optimization of covering arrays
• Optimal and near-optimal mixed covering arrays by column expansion
• Problems and algorithms for covering arrays

Cites work

• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• A survey of methods for constructing covering arrays
• Covering and radius-covering arrays: constructions and classification
• On t-covering arrays
• Problems and algorithms for covering arrays
• Randomized postoptimization of covering arrays
• Software and hardware testing using combinatorial covering suites
• The Mathematics of the Pentium Division Bug
• Vector sets for exhaustive testing of logic circuits

Cited in

(10)

• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• Randomized postoptimization of covering arrays
• A survey of methods for constructing covering arrays
• Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
• Generating covering arrays using ant colony optimization: exploration and mining
• MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
• CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
• Randomized post-optimization of covering arrays
• A greedy-metaheuristic 3-stage approach to construct covering arrays
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)

Describes a project that uses

Uses Software

• AETG
• OEIS

This page was built for publication: Mixed optimization combinatorial method for constructing covering arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017763)