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

Avila-George, 2012, Simulated annealing for constructing mixed covering arrays, vol. 151, 657

Cohen, M., P. Gibbons, W. Mugridge, C. Colbourn and J. Collofello, A variable strength interaction testing of components, in: Proceedings of the 27th Annual International Computer Software and Applications Conference., 2003, pp. 413–418.

Forbes, 2008, Refining the in-parameter-order strategy for constructing covering arrays, Journal of Research of the National Institute of Standards and Technology, 113, 287, 10.6028/jres.113.022

Gonzalez-Hernandez, 2010, Construction of mixed covering arrays of variable strength using a tabu search approach, 6508, 51

Gonzalez-Hernandez, L. and J. Torres-Jimenez, Mits: A new approach of tabu search for constructing mixed covering arrays 6438 (2010), pp. 382–393.

Gonzalez-Hernandez, 2011, An exact approach to maximize the number of wild cards in a covering array, 7094, 210

Hansen, 2001, Variable neighborhood search: Principles and applications, European journal of operational research, 130, 449, 10.1016/S0377-2217(00)00100-4

Hansen, 2003, Variable neighborhood search, vol. 57, 145

Hansen, P., N. Mladenovic and Q. Groupe d'études et de recherche en analyse des décisions (Montréal, A tutorial on variable neighborhood search (2003).).

Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671

Lei, Y., R. Kacker, D. Kuhn, V. Okun and J. Lawrence, Ipog: a general strategy for t-way software testing, in: Proceedings of the 14th Annual IEEE International Conference and Workshops on theEngineering of Computer-Based Systems. ECBS '07, Tucson, AZ, USA, 2007.

Mladenovic, 1997, Variable neighborhood search, Computers & Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2

NIST, The economic impacts of inadequate infrastructure for software testing, U.S. Deparment of Commerce (2002).

Rodriguez-Cristerna, 2011, A mutation-selection algorithm for the problem of minimum brauer chains, vol. 7095, 107

Rodriguez-Tello, 2008, An improved simulated annealing algorithm for bandwidth minimization, European Journal of Operational Research, 127, 1319, 10.1016/j.ejor.2005.12.052

Torres-Jimenez, 2012, New bounds for binary covering arrays using simulated annealing, Information Sciences, 185, 137, 10.1016/j.ins.2011.09.020