Novel heuristic and genetic algorithms for the VLSI test coverage problem

IEEE International Conference on Computer Systems and Applications, 2006

Volumn 2006, Issue , 2006, Pages 402-408

  Ibrahim, Walid ^a   El Chouemi, Amr ^a   El Sayed, Hesham ^a  

^a UNITED ARAB EMIRATES UNIVERSITY   (United Arab Emirates)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; PROBLEM SOLVING; RESOURCE ALLOCATION; VLSI CIRCUITS;

COMPUTING CYCLES; TEST COVERAGE PROBLEM; TEST-CASES;

HEURISTIC METHODS;

EID: 33750840761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/aiccsa.2006.205122     Document Type: Conference Paper

References (12)

1. Aickelin, U. "An indirect genetic algorithm for set covering problems", J. Oper. Res. Soc. 53 (2002), 1118-1126.
2. Beasley, J. E. and Chu, P. C. "A genetic algorithm for the set covering problem", European J. Oper. Res. 94 (1996), 392-404.
3. Garey, M. R. and Johnson, D. S., "Computers and Intractability: A Guide to the Theory of NP-Completeness", Freeman, San Francisco, 1979.
4. Haddadi, S., "Simple Lagrangian heuristic for the set covering problem", European J. Oper. Res. 97 (1997), 200-204.
5. Mannino C., Sassano A., "Solving Hard Set Covering Problems", Oper. Res. Letters, vol. 18, 1995, pp. 1-5.
6. Ohlsson, M., Peterson, C. and Söberderg, B., "An efficient mean field approach to the set covering problem", European J. Oper. Res. 133 (2001), 583-599.
7. Grosman T. and Wool A., "Computational experience with approximation algorithms for the set covering problem", European Journal of Operational Research, 101:81-92, 1997.
8. Sen, S., "Minimal cost set covering using probabilistic methods", in Proceedings of the 1993 ACM Symposium on Applied Computing: States of the Art and Practice, 1993, pp. 157-164.
9. Solar, M., Parada, V. and Urrutia, R., "A parallel genetic algorithm to solve the set-covering problem", Comput. Oper. Res. 29 (2002), 1221-1235.
10. Taguchi, G., "System of Experimental Design", Vols. 1 and 2, UNIPUB/Kraus International Publications, New York, 1987.
11. LI J. and Kwan R. S. K., "A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem", Journal of Mathematical Modelling and Algorithms 3: 263-283, 2004.
12. GAlib, "A C++ Library of Genetic Algorithm Components", version 2.4.6 http://lancct.mit.edu/aa/