Computing minimal hitting sets with a genetic algorithm

MaRDI QIDQ5754335zbMATH OpenFDO

Authors Nan Zhang, Jigui Sun, Xiangfu Zhao, Dantong Ouyang

Publication date 22 August 2007

zbMATH Keywords

elite strategy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• The minimal hitting set generation problem: algorithms and computation
• Minimal approximate hitting sets and rule templates
• Genetic algorithms applied to computationally difficult set covering problems
• The computation of hitting sets: Review and new algorithms
• Optimizations for the Boolean approach to computing minimal hitting sets

Cited in

(9)

• The computation of hitting sets: Review and new algorithms
• Minimal approximate hitting sets and rule templates
• A variant of Reiter's hitting-set algorithm
• A method of combining SE-tree to compute all minimal hitting sets
• The minimal hitting set generation problem: algorithms and computation
• Optimizations for the Boolean approach to computing minimal hitting sets
• scientific article; zbMATH DE number 2040676 (Why is no real title available?)
• scientific article; zbMATH DE number 2114142 (Why is no real title available?)
• scientific article; zbMATH DE number 5061975 (Why is no real title available?)

This page was built for publication: Computing minimal hitting sets with a genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5754335)