Convex separable minimization subject to bounded variables (Q5931032)
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 1592713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex separable minimization subject to bounded variables |
scientific article; zbMATH DE number 1592713 |
Statements
Convex separable minimization subject to bounded variables (English)
0 references
26 June 2001
0 references
convex programming
0 references
separable programming
0 references
single constrained program
0 references
knapsack problem
0 references
algorithms
0 references
0.9574024081230164
0 references
0.9204174876213074
0 references
0.8925067186355591
0 references
0.8861851692199707
0 references
