Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204)
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: Lower bounds and algorithms for the minimum cardinality bin covering problem |
scientific article; zbMATH DE number 6872214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds and algorithms for the minimum cardinality bin covering problem |
scientific article; zbMATH DE number 6872214 |
Statements
Lower bounds and algorithms for the minimum cardinality bin covering problem (English)
0 references
24 May 2018
0 references
bin covering
0 references
minimum cardinality
0 references
lower bounds
0 references
heuristics
0 references
branch-and-bound
0 references
0 references
0 references
0.8342790603637695
0 references
0.7933526635169983
0 references
0.7886406183242798
0 references
0.7741036415100098
0 references
0.7739019989967346
0 references
