A penalty algorithm for solving convex separable knapsack problems (Q2660092): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Robinson Hoto / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Luiz Carlos Matioli / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: NAPHEAP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2019.124855 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2986871914 / rank | |||
Normal rank |
Revision as of 22:13, 19 March 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