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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q332134
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ming-Hui Zhang / 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-015-9976-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2279442010 / 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: 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

    Online bin packing problem with buffer and bounded size revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 February 2017
    0 references
    0 references
    bin packing
    0 references
    online algorithm
    0 references
    asymptotic competitive ratio
    0 references
    0 references