Mixed optimization combinatorial method for constructing covering arrays

DOI10.1134/S036176881401006XzbMath1323.68045MaRDI QIDQ2017763

A. A. Petukhov

Publication date: 23 March 2015

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

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)

Uses Software

• OEIS
• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Covering and radius-covering arrays: constructions and classification
• A survey of methods for constructing covering arrays
• Problems and algorithms for covering arrays
• On \(t\)-covering arrays
• Randomized Postoptimization of Covering Arrays
• Vector sets for exhaustive testing of logic circuits
• The Mathematics of the Pentium Division Bug
• t-Covering Arrays: Upper Bounds and Poisson Approximations

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