Online bin packing problem with buffer and bounded size revisited (Q511697): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER / 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: The Trim Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on online bin packing with two item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic bin packing with unit fraction items revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / 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: 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: New Algorithms for Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: NF-based algorithms for online bin packing with buffer and bounded item size / rank
 
Normal rank

Latest revision as of 11:47, 13 July 2024

scientific article
Language Label Description Also known as
English
Online bin packing problem with buffer and bounded size revisited
scientific article

    Statements

    Identifiers