The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
scientific article

    Statements

    The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (English)
    0 references
    0 references
    0 references
    1991
    0 references
    greedy-algorithms
    0 references
    knapsack problems
    0 references
    stochastic analysis of heuristic algorithms
    0 references
    subset sum maximization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references