An adaptive heuristic algorithm for VLSI test vectors selection

DOI10.1016/j.ejor.2008.03.049zbMath1176.90659OpenAlexW2069206363MaRDI QIDQ1042192

Walid Ibrahim, Amr El-Chouemie, Hoda Amer, Hesham El-Sayed

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.049

zbMATH Keywords

verificationinteger programmingheuristic algorithmsVLSISCP

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• A meta-heuristic with orthogonal experiment for the set covering problem
• A genetic algorithm for the set covering problem
• Simple Lagrangian heuristic for the set covering problem
• Computational experience with approximation algorithms for the set covering problem
• Approximation algorithms for the test cover problem
• A parallel genetic algorithm to solve the set-covering problem
• Solving hard set covering problems
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• An indirect genetic algorithm for set covering problems
• An efficient mean field approach to the set covering problem

This page was built for publication: An adaptive heuristic algorithm for VLSI test vectors selection