A tight lower bound for optimal bin packing (Q1919179): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6377(95)00041-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2142050419 / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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