A lower bound for on-line bin packing (Q1144944)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3694611
Language Label Description Also known as
default for all languages
No label defined
    English
    A lower bound for on-line bin packing
    scientific article; zbMATH DE number 3694611

      Statements

      A lower bound for on-line bin packing (English)
      0 references
      0 references
      1980
      0 references
      lower bounds
      0 references
      NP-completeness
      0 references
      on-line bin packing algorithm
      0 references

      Identifiers