A two-stage algorithm for combinatorial testing
From MaRDI portal
Publication:519759
DOI10.1007/s11590-016-1012-xzbMath1367.90098OpenAlexW2264298794MaRDI QIDQ519759
Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Himer Avila-George
Publication date: 5 April 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1012-x
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A greedy-metaheuristic 3-stage approach to construct covering arrays ⋮ Improved covering arrays using covering perfect hash families with groups of restricted entries
Cites Work
- Unnamed Item
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Tabu search for covering arrays using permutation vectors
- Covering arrays from cyclotomy
- On the state of strength-three covering arrays
- Group construction of covering arrays
- Covering arrays and intersecting codes
- Orthogonal Arrays of Index Unity