A unified method for a class of convex separable nonlinear knapsack problems (Q930930)
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 5292261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified method for a class of convex separable nonlinear knapsack problems |
scientific article; zbMATH DE number 5292261 |
Statements
A unified method for a class of convex separable nonlinear knapsack problems (English)
0 references
24 June 2008
0 references
nonlinear knapsack problem
0 references
convex programming
0 references
separable programming
0 references
singly constrained program
0 references
0 references
0 references
0 references
0 references
0.9253936
0 references
0.9253355
0 references
0.9249758
0 references
0.92015314
0 references
0.9193238
0 references
0.91612333
0 references
0 references
0.9123423
0 references
