NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-014-9771-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982495803 / 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: On-line bin packing with restricted repacking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic 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: Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations / 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: Algorithms for the Relaxed Online Bin-Packing Model / 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: On-line bin packing ? A restricted survey / 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: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / 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: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time-approximation algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing / rank
 
Normal rank

Latest revision as of 14:30, 10 July 2024

scientific article
Language Label Description Also known as
English
NF-based algorithms for online bin packing with buffer and bounded item size
scientific article

    Statements

    NF-based algorithms for online bin packing with buffer and bounded item size (English)
    0 references
    0 references
    28 July 2015
    0 references
    bin packing
    0 references
    online algorithm
    0 references
    asymptotic competitive ratio
    0 references

    Identifiers