Colored bin packing: online algorithms and lower bounds (Q1702125): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online results for black and white bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black and White 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: The optimal absolute ratio for online bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Colored Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Bounded-Space Bin Packing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded space on-line bin packing: Best is better than first / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Analysis of Best Fit Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On online bin packing with LIB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / 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: Q4552137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank

Latest revision as of 06:29, 15 July 2024

scientific article
Language Label Description Also known as
English
Colored bin packing: online algorithms and lower bounds
scientific article

    Statements

    Colored bin packing: online algorithms and lower bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithms
    0 references
    bin packing
    0 references
    worst-case analysis
    0 references
    colored bin packing
    0 references
    black and white bin packing
    0 references
    0 references