A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays

DOI10.1016/j.endm.2012.10.033zbMath1268.68154OpenAlexW2139387867MaRDI QIDQ2840782

Arturo Rodriguez-Cristerna, Jose Torres-Jimenez

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.033

zbMATH Keywords

simulated annealingvariable neighborhood searchmixed covering arrays

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search ⋮ Covering array EXtender

Cites Work

• Optimization by Simulated Annealing
• Variable neighborhood search
• An improved simulated annealing algorithm for bandwidth minimization
• Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
• Variable Neighborhood Search
• Variable neighborhood search: Principles and applications

This page was built for publication: A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays