A new lower bound for classic online bin packing (Q5918310): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2884181851 / rank
 
Normal rank
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: Q5009562 / 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: Online bin packing with cardinality constraints resolved / 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: New lower bounds for certain classes of bin packing algorithms / 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: A survey on makespan minimization in semi-online environments / 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: Beating the Harmonic Lower Bound for Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for 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 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: On-line bin packing in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / 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 02:17, 26 July 2024

scientific article; zbMATH DE number 7365270
Language Label Description Also known as
English
A new lower bound for classic online bin packing
scientific article; zbMATH DE number 7365270

    Statements

    A new lower bound for classic online bin packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2021
    0 references

    Identifiers