A penalty algorithm for solving convex separable knapsack problems (Q2660092)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7328866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A penalty algorithm for solving convex separable knapsack problems |
scientific article; zbMATH DE number 7328866 |
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
0 references
0 references
0 references
0 references
0.9415721
0 references
0.91821676
0 references
0.9105881
0 references
0.9076794
0 references
0.90240324
0 references
0.90237314
0 references
0.90092444
0 references
