Lower bound for 3-batched bin packing (Q1751161): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2016.04.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2418108244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Harmonic Lower Bound for Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for certain classes of bin packing algorithms / 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: Q4886075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing revisited / rank
 
Normal rank

Latest revision as of 16:06, 15 July 2024

scientific article
Language Label Description Also known as
English
Lower bound for 3-batched bin packing
scientific article

    Statements

    Lower bound for 3-batched bin packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    batched bin packing
    0 references
    worst-case behavior
    0 references
    lower bound
    0 references

    Identifiers