A penalty algorithm for solving convex separable knapsack problems (Q2660092): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: NAPHEAP / rank | |||
Normal rank |
Revision as of 05:04, 28 February 2024
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
29 March 2021
0 references
separable knapsack problem
0 references
exterior projections
0 references
gradient method
0 references
Bregman distances
0 references