An exact algorithm for 0-1 polynomial Knapsack problems (Q2469794)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An exact algorithm for 0-1 polynomial Knapsack problems
scientific article

    Statements

    An exact algorithm for 0-1 polynomial Knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2008
    0 references
    Lagrangian relaxation
    0 references
    branch-and-bound method
    0 references
    maximum-flow algorithm
    0 references

    Identifiers

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