Randomized post-optimization of covering arrays
type: Item
instance of: scholarly article
title: Randomized post-optimization of covering arrays
zbMATH Open document ID: 1252.05023
author: Peyman Nayeri
author: Charles J. Colbourn
author: Goran Konjevod
published in: European Journal of Combinatorics
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6106897
describes a project that uses: AETG
MaRDI profile type: Publication
full work available at URL: j.ejc.2012.07.017
OpenAlex ID: W2052799565
cites work: On the state of strength-three covering arrays
cites work: Constructing strength three covering arrays with augmented annealing
cites work: Q5327064
cites work: Strength two covering arrays: existence tables and projection
cites work: Covering arrays from cyclotomy
cites work: The complexity of completing partial Latin squares
cites work: Binary Covering Arrays and Existentially Closed Graphs
cites work: Covering and radius-covering arrays: constructions and classification
cites work: Products of mixed covering arrays of strength two
cites work: Roux-type constructions for covering arrays of strengths three and four
cites work: t-Covering Arrays: Upper Bounds and Poisson Approximations
cites work: Q3374252
cites work: Orthogonal arrays. Theory and applications
cites work: Constraint models for the covering test problem
cites work: Largest induced subgraphs of the n-cube that contain no 4-cycles
cites work: PASCALIAN RECTANGLES MODULOm
cites work: Two applications (for search theory and truth functions) of Sperner type theorems
cites work: Families of \(k\)-independent sets
cites work: Q5488390
cites work: On \(t\)-covering arrays
cites work: Group construction of covering arrays
cites work: Randomized Postoptimization of Covering Arrays
cites work: Upper bounds for covering arrays by tabu search.
cites work: Covering arrays of higher strength from permutation vectors
cites work: Q5461518
cites work: Iterative Exhaustive Pattern Generation for Logic Testing
cites work: Tabu search for covering arrays using permutation vectors
DOI: 10.1016/J.EJC.2012.07.017
description: scientific article; zbMATH DE number 6106897