A polynomially solvable special case of the unbounded knapsack problem (Q5949903)

From MaRDI portal
scientific article; zbMATH DE number 1678856
Language Label Description Also known as
English
A polynomially solvable special case of the unbounded knapsack problem
scientific article; zbMATH DE number 1678856

    Statements

    A polynomially solvable special case of the unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2001
    0 references
    knapsack
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    polynomial time algorithm
    0 references
    computatioal complexity
    0 references

    Identifiers