Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

DOI10.1007/s11590-019-01459-0zbMath1448.90083OpenAlexW2965312623WikidataQ127411554 ScholiaQ127411554MaRDI QIDQ2193001

Ludwig Kampel, Manuel Leithner, Dimitris E. Simos

Publication date: 24 August 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01459-0

zbMATH Keywords

greedy algorithmscovering arraysAETG

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

In-parameter-order strategies for covering perfect hash families ⋮ Heuristically enhanced IPO algorithms for covering array generation

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
• Constraint models for the covering test problem
• Constructing new covering arrays from LFSR sequences over finite fields
• Constructing strength three covering arrays with augmented annealing
• Covering arrays from cyclotomy
• Upper bounds for covering arrays by tabu search.
• Randomized post-optimization of covering arrays
• Problems and algorithms for covering arrays via set covers
• A survey on the problems and algorithms for covering arrays via set covers
• Vector sets for exhaustive testing of logic circuits
• Algebraic Modelling of Covering Arrays

This page was built for publication: Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm