Resolution principle for the minimum covering problem of a 0-1 matrix

DOI10.1007/BF02366588MaRDI QIDQ1364118zbMATH OpenOpenAlexFDO

Authors O. V. German

Publication date 24 August 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02366588

zbMATH Keywords

0-1 matrixgroup resolution principleminimum covering problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2000148
• scientific article; zbMATH DE number 709680
• Computer Solutions to Minimum-Cover Problems
• scientific article; zbMATH DE number 4099049
• Entropy and set covering

Cited in

(1)

• scientific article; zbMATH DE number 709680 (Why is no real title available?)

This page was built for publication: Resolution principle for the minimum covering problem of a 0-1 matrix

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