Randomized postoptimization of covering arrays

DOI10.1007/978-3-642-10217-2_40MaRDI QIDQ3651567zbMATH OpenOpenAlexFDO

Authors 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 arraysnumber of rowspostoptimization

Mathematics Subject Classification ID

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

Recommendations

• Randomized post-optimization of covering arrays
• Mixed optimization combinatorial method for constructing covering arrays
• Covering arrays via set covers
• Upper bounds for covering arrays by tabu search.

Cited in

(15)

• Randomized post-optimization of covering arrays
• Mixed optimization combinatorial method for constructing covering arrays
• Consecutive covering arrays and a new randomness test
• Improving two recursive constructions for covering arrays
• MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
• Covering arrays, augmentation, and quilting arrays
• Generating covering arrays using ant colony optimization: exploration and mining
• Randomized Post-optimization for t-Restrictions
• On uniform covering, adaptive random search and raspberries
• Constructions of covering arrays of strength five
• Covering and radius-covering arrays: constructions and classification
• A survey of methods for constructing covering arrays
• Cover starters for covering arrays of strength two
• Augmentation of covering arrays of strength two
• Covering arrays from cyclotomy

This page was built for publication: Randomized postoptimization of covering arrays

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