Polynomiality for Bin Packing with a Constant Number of Item Types (Q5056451)
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: Polynomiality for Bin Packing with a Constant Number of Item Types |
scientific article; zbMATH DE number 7629066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomiality for Bin Packing with a Constant Number of Item Types |
scientific article; zbMATH DE number 7629066 |
Statements
Polynomiality for Bin Packing with a Constant Number of Item Types (English)
0 references
8 December 2022
0 references
bin packing
0 references
high multiplicity scheduling
0 references
integer programming
0 references
polynomial-time algorithms
0 references
0.9982019066810608
0 references
0.8159471154212952
0 references
0.8018257021903992
0 references
0.8012027144432068
0 references
0.8007393479347229
0 references
