A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455)

From MaRDI portal
Revision as of 15:04, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 760375
Language Label Description Also known as
English
A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
scientific article; zbMATH DE number 760375

    Statements

    A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (English)
    0 references
    0 references
    0 references
    0 references
    1 June 1995
    0 references
    branch and bound
    0 references
    separable convex quadratic knapsack
    0 references
    lower and upper bounds
    0 references
    reoptimization
    0 references

    Identifiers