A penalty algorithm for solving convex separable knapsack problems (Q2660092)

From MaRDI portal
Revision as of 01:22, 7 August 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
A penalty algorithm for solving convex separable knapsack problems
scientific article

    Statements

    A penalty algorithm for solving convex separable knapsack problems (English)
    0 references
    0 references
    0 references
    29 March 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    separable knapsack problem
    0 references
    exterior projections
    0 references
    gradient method
    0 references
    Bregman distances
    0 references