On the constructive enumeration of packings and coverings of index one (Q2276965)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4193687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the constructive enumeration of packings and coverings of index one |
scientific article; zbMATH DE number 4193687 |
Statements
On the constructive enumeration of packings and coverings of index one (English)
0 references
1989
0 references
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.
0 references
computerized search
0 references
packing and covering problems
0 references
0.7542431354522705
0 references
0.7493138313293457
0 references
0.7483010292053223
0 references
