Upper bounds for covering arrays by tabu search.

DOI10.1016/S0166-218X(03)00291-9zbMath1034.05013MaRDI QIDQ1428561

Kari J. Nurmela

Publication date: 29 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (25)

A primer on the application of neural networks to covering array generation ⋮ CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH ⋮ Constraint models for the covering test problem ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ A formal logic approach to constrained combinatorial testing ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Locating and detecting arrays for interaction faults ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Algebraic Modelling of Covering Arrays ⋮ Structures and lower bounds for binary covering arrays ⋮ Covering array EXtender ⋮ Strength two covering arrays: existence tables and projection ⋮ Tabu search for covering arrays using permutation vectors ⋮ Randomized post-optimization of covering arrays ⋮ Covering and radius-covering arrays: constructions and classification ⋮ A Logic-Based Approach to Combinatorial Testing with Constraints ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Computational cost of the Fekete problem. I: The forces method on the 2-sphere ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ A survey of methods for constructing covering arrays ⋮ Cover starters for covering arrays of strength two ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays ⋮ On the state of strength-three covering arrays

Uses Software

• AETG

Cites Work

• On qualitatively independent partitions and related problems
• On the maximum number of qualitative independent partitions
• Lower bounds for transversal covers
• Sperner capacities
• Vector sets for exhaustive testing of logic circuits
• Tabu Search—Part I
• New techniques for designing qualitatively independent systems
• Covering arrays and intersecting codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds for covering arrays by tabu search.