Pages that link to "Item:Q2017763"
From MaRDI portal
The following pages link to Mixed optimization combinatorial method for constructing covering arrays (Q2017763):
Displaying 9 items.
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- Generating covering arrays using ant colony optimization: exploration and mining (Q2951194) (← links)
- CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH (Q3166745) (← links)
- (Q3594048) (← links)