Semi-on-line bin packing: a short overview and a new lower bound (Q301113): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6599503 / rank
 
Normal rank
Property / zbMATH Keywords
 
bin packing
Property / zbMATH Keywords: bin packing / rank
 
Normal rank
Property / zbMATH Keywords
 
semi-on-line algorithms
Property / zbMATH Keywords: semi-on-line algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
asymptotic competitive ratio
Property / zbMATH Keywords: asymptotic competitive ratio / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bound
Property / zbMATH Keywords: lower bound / rank
 
Normal rank

Revision as of 22:56, 27 June 2023

scientific article
Language Label Description Also known as
English
Semi-on-line bin packing: a short overview and a new lower bound
scientific article

    Statements

    Semi-on-line bin packing: a short overview and a new lower bound (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    bin packing
    0 references
    semi-on-line algorithms
    0 references
    asymptotic competitive ratio
    0 references
    lower bound
    0 references

    Identifiers