Heuristically enhanced IPO algorithms for covering array generation

DOI10.1007/978-3-030-79987-8_40MaRDI QIDQ2115896zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79987-8_40

zbMATH Keywords

optimizationsimulated annealingheuristicscovering arrays

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A survey on the problems and algorithms for covering arrays via set covers
• An efficient design and implementation of the in-parameter-order algorithm
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Constraint models for the covering test problem
• IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation
• Introduction to combinatorial testing
• Orthogonal Arrays of Index Unity
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

Cited in

(2)

• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
• A greedy-metaheuristic 3-stage approach to construct covering arrays

Describes a project that uses

Uses Software

• AETG
• CAgen

This page was built for publication: Heuristically enhanced IPO algorithms for covering array generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115896)