Simplification of the Covering Problem with Application to Boolean Expressions

DOI10.1145/321556.321572MaRDI QIDQ5594965zbMATH OpenOpenAlexFDO

Authors Melvin A. Breuer

Publication date 1970

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321556.321572

zbMATH Keywords

operations research

Cited in

(9)

• A parallel genetic algorithm to solve the set-covering problem
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• Steiner's problem in graphs and its implications
• Set covering approach for reconstruction of sibling relationships
• Ordered weighted average optimization in multiobjective spanning tree problem
• Algorithms for large scale set covering problems
• Enhancing an algorithm for set covering problems
• On discrete optimization with ordering
• A binary cat swarm optimization algorithm for the non-unicost set covering problem

This page was built for publication: Simplification of the Covering Problem with Application to Boolean Expressions

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