Upper bounds for covering arrays by tabu search.
type: Item
instance of: scholarly article
title: Upper bounds for covering arrays by tabu search.
zbMATH Open document ID: 1034.05013
DOI: 10.1016/S0166-218X(03)00291-9
author: Kari J. Nurmela
published in: Discrete Applied Mathematics
publication date: 2004-03-29T00:00:00Z
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 2062820
describes a project that uses: AETG
MaRDI profile type: Publication
cites work: New techniques for designing qualitatively independent systems
cites work: Q4876930
cites work: Sperner capacities
cites work: Tabu Search—Part I
cites work: On qualitatively independent partitions and related problems
cites work: On the maximum number of qualitative independent partitions
cites work: Vector sets for exhaustive testing of logic circuits
cites work: Covering arrays and intersecting codes
cites work: Q5461518
cites work: Lower bounds for transversal covers
description: scientific article; zbMATH DE number 2062820