Lower bounds for batched bin packing (Q2125232): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: József Békési / rank
Normal rank
 
Property / author
 
Property / author: György Dósa / rank
Normal rank
 
Property / author
 
Property / author: József Békési / rank
 
Normal rank
Property / author
 
Property / author: György Dósa / rank
 
Normal rank
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.1007/s10878-021-00797-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3194765939 / 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: Lower bound for 3-batched bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for several online variants of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for classic online bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for online bin packing with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on batched bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for online rectangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Lower Bound for On-Line Bin-Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for on-line bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for on-line bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank

Latest revision as of 16:08, 28 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for batched bin packing
scientific article

    Statements

    Lower bounds for batched bin packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2022
    0 references
    0 references
    bin packing
    0 references
    batched problems
    0 references
    competitive analysis
    0 references
    online algorithms
    0 references
    0 references