Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ro:2006001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO:2006001 / rank | |||
Normal rank | |||
Latest revision as of 17:04, 30 December 2024
scientific article; zbMATH DE number 5039992
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing |
scientific article; zbMATH DE number 5039992 |
Statements
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (English)
0 references
11 July 2006
0 references
online approximation algorithm
0 references
asymptotic worst case ratio
0 references
bin covering problem
0 references
bin packing problem
0 references
longest item
0 references
uniform sized bins
0 references
