Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems (Q3792258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems |
scientific article; zbMATH DE number 4057029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems |
scientific article; zbMATH DE number 4057029 |
Statements
Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems (English)
0 references
1988
0 references
subset-generating algorithm
0 references
base enumeration
0 references
lexicographic enumeration
0 references
knapsack
0 references
minimal covering
0 references
0.7443587183952332
0 references
0.7369784116744995
0 references
0.7341829538345337
0 references
