Simplification of the Covering Problem with Application to Boolean Expressions

DOI10.1145/321556.321572zbMath0198.24501OpenAlexW2071580092MaRDI QIDQ5594965

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

Related Items

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