Batched bin packing (Q1779689): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Does randomization help in on-line bin packing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repacking helps in bounded space on-line bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps / 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: 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
Property / cites work
 
Property / cites work: An on-line bin-batching problem. / rank
 
Normal rank

Latest revision as of 12:05, 10 June 2024

scientific article
Language Label Description Also known as
English
Batched bin packing
scientific article

    Statements

    Batched bin packing (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2005
    0 references
    0 references
    On-line algorithm
    0 references
    Lower bounds
    0 references
    Bin packing
    0 references
    Competitive ratio
    0 references
    0 references