Mixed optimization combinatorial method for constructing covering arrays
From MaRDI portal
Publication:2017763
DOI10.1134/S036176881401006XzbMATH Open1323.68045MaRDI QIDQ2017763FDOQ2017763
Authors: A. A. Petukhov 
Publication date: 23 March 2015
Published in: Programming and Computer Software (Search for Journal in Brave)
Recommendations
Combinatorial optimization (90C27) Orthogonal arrays, Latin squares, Room squares (05B15) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Problems and algorithms for covering arrays
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Title not available (Why is that?)
- On \(t\)-covering arrays
- Software and hardware testing using combinatorial covering suites
- Covering and radius-covering arrays: constructions and classification
- Vector sets for exhaustive testing of logic circuits
- A survey of methods for constructing covering arrays
- Randomized postoptimization of covering arrays
- The Mathematics of the Pentium Division Bug
Cited In (10)
- Title not available (Why is that?)
- 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}\)
Uses Software
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)
