Randomized Postoptimization of Covering Arrays

DOI10.1007/978-3-642-10217-2_40zbMath1267.05051OpenAlexW2173406977MaRDI QIDQ3651567

Peyman Nayeri, Charles J. Colbourn, Goran Konjevod

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_40

zbMATH Keywords

covering arrayspostoptimizationnumber of rows

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (10)

Constructions of covering arrays of strength five ⋮ Randomized Post-optimization for t-Restrictions ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ A survey of methods for constructing covering arrays ⋮ Cover starters for covering arrays of strength two ⋮ Improving two recursive constructions for covering arrays ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays

This page was built for publication: Randomized Postoptimization of Covering Arrays