What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196)

From MaRDI portal
Revision as of 14:50, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
What is the best greedy-like heuristic for the weighted set covering problem?
scientific article

    Statements

    What is the best greedy-like heuristic for the weighted set covering problem? (English)
    0 references
    0 references
    0 references
    0 references
    2 October 2018
    0 references
    heuristics
    0 references
    weighted set covering problem
    0 references
    greedy algorithms
    0 references
    column knowledge functions
    0 references
    row knowledge functions
    0 references

    Identifiers