AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS (Q3931021)

From MaRDI portal
Revision as of 20:09, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS
scientific article

    Statements

    AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting plane algorithm
    0 references
    0-1 bilinear knapsack problem
    0 references
    integer quadratic programming
    0 references
    bipartite matching
    0 references
    multi-attribute utility analysis
    0 references
    cutting stock problems
    0 references