A Greedy Heuristic for the Set-Covering Problem (Q3887227)

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 3693006
Language Label Description Also known as
default for all languages
No label defined
    English
    A Greedy Heuristic for the Set-Covering Problem
    scientific article; zbMATH DE number 3693006

      Statements

      A Greedy Heuristic for the Set-Covering Problem (English)
      0 references
      1979
      0 references
      greedy heuristic
      0 references
      set-covering problem
      0 references
      binary matrix
      0 references
      approximate solution
      0 references
      asymptotic exactness estimation
      0 references

      Identifiers