Tabu search for covering arrays using permutation vectors
type: Item
instance of: scholarly article
title: Tabu search for covering arrays using permutation vectors
zbMATH Open document ID: 1284.62497
author: Robert A. II Walker
author: Charles J. Colbourn
published in: Journal of Statistical Planning and Inference
publication date: 2008-11-06T00:00:00Z
Mathematics Subject Classification ID: 62K99
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5363137
zbMATH Keywords: covering array
zbMATH Keywords: orthogonal array
zbMATH Keywords: permutation vector
zbMATH Keywords: tabu search
zbMATH Keywords: heuristic search
describes a project that uses: Tabu search
describes a project that uses: AETG
MaRDI profile type: Publication
full work available at URL: j.jspi.2008.05.020
OpenAlex ID: W1997301902
cites work: On the state of strength-three covering arrays
cites work: Constructing strength three covering arrays with augmented annealing
cites work: Roux-type constructions for covering arrays of strengths three and four
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Q4354785
cites work: Q3374252
cites work: Problems and algorithms for covering arrays
cites work: Orthogonal arrays. Theory and applications
cites work: Q5488390
cites work: On \(t\)-covering arrays
cites work: Upper bounds for covering arrays by tabu search.
cites work: Covering arrays of higher strength from permutation vectors
cites work: Covering arrays and intersecting codes
cites work: Perfect Hash Families: Constructions and Existence
DOI: 10.1016/J.JSPI.2008.05.020
description: scientific article; zbMATH DE number 5363137