Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464)

From MaRDI portal
Revision as of 22:42, 29 July 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
Solving a class of multiplicative programs with 0-1 knapsack constraints
scientific article

    Statements

    Solving a class of multiplicative programs with 0-1 knapsack constraints (English)
    0 references
    0 references
    16 March 2000
    0 references
    multiplicative programming
    0 references
    \(0-1\) knapsack problems
    0 references
    concave minimization
    0 references
    branch-and-bound algorithms
    0 references
    Lagrangian relaxation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references