A greedy-metaheuristic 3-stage approach to construct covering arrays
From MaRDI portal
Publication:2198200
DOI10.1016/j.ins.2018.05.047zbMath1440.68347MaRDI QIDQ2198200
Himer Avila-George, Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Brenda Acevedo-Juárez
Publication date: 9 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.05.047
simulated annealing; greedy algorithms; metaheuristic algorithms; covering arrays; covering perfect hash families; 3-stage approach
68W40: Analysis of algorithms
68R05: Combinatorics in computer science
90C59: Approximation methods and heuristics in mathematical programming
05B15: Orthogonal arrays, Latin squares, Room squares