On the constructive enumeration of packings and coverings of index one

DOI10.1016/0012-365X(89)90363-4MaRDI QIDQ2276965zbMATH OpenOpenAlexFDO

Authors A. Ya. Petrenyuk

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(89)90363-4

zbMATH Keywords

computerized searchpacking and covering problems

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

The authors consider a computerized search for all solutions to various packing and covering problems in the classical case of k-sets from a v- set with \(\lambda =1\). The methods involve straightforward search.

Recommendations

• scientific article; zbMATH DE number 810048
• scientific article; zbMATH DE number 124521
• Combinatorial problems of packing and covering and related problems of integer linear program\-ming
• A method for the implicit exhaustive search of solutions to some extremum problems on sets
• Application of implicit enumeration to solve the packing problem

Cites work

• Balanced incomplete block designs and related designs
• scientific article; zbMATH DE number 4014735 (Why is no real title available?)
• scientific article; zbMATH DE number 3813647 (Why is no real title available?)
• scientific article; zbMATH DE number 3767686 (Why is no real title available?)
• scientific article; zbMATH DE number 3549004 (Why is no real title available?)
• scientific article; zbMATH DE number 3235247 (Why is no real title available?)
• Minimal coverings of pairs by triples
• On coverings

Cited in

(2)

• On \(k^+\)-neighbour packings and one-sided Hadwiger configurations
• A method for the implicit exhaustive search of solutions to some extremum problems on sets

This page was built for publication: On the constructive enumeration of packings and coverings of index one

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