A tight lower bound for optimal bin packing (Q1919179): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast algorithms for bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple on-line bin-packing algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The average-case analysis of some on-line algorithms for bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New Algorithms for Bin Packing / rank | |||
Normal rank |
Latest revision as of 13:52, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A tight lower bound for optimal bin packing |
scientific article |
Statements
A tight lower bound for optimal bin packing (English)
0 references
1 August 1996
0 references
best fit decreasing
0 references
harmonic partition
0 references
matching
0 references
tight lower bound
0 references
one-dimensional bin packing
0 references