A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ins.2018.05.047 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2805417520 / rank | |||
Normal rank | |||
Revision as of 20:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy-metaheuristic 3-stage approach to construct covering arrays |
scientific article |
Statements
A greedy-metaheuristic 3-stage approach to construct covering arrays (English)
0 references
9 September 2020
0 references
greedy algorithms
0 references
metaheuristic algorithms
0 references
covering arrays
0 references
3-stage approach
0 references
covering perfect hash families
0 references
simulated annealing
0 references
