A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A modified greedy heuristic for the set covering problem with improved worst case bound
scientific article

    Statements

    A modified greedy heuristic for the set covering problem with improved worst case bound (English)
    0 references
    0 references
    0 references
    0 references
    25 September 1994
    0 references
    set covering problems
    0 references
    greedy algorithm
    0 references

    Identifiers