An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360)
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 5203883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for multi-dimensional nonlinear knapsack problems |
scientific article; zbMATH DE number 5203883 |
Statements
An efficient algorithm for multi-dimensional nonlinear knapsack problems (English)
0 references
23 October 2007
0 references
nonlinear integer programming
0 references
nonlinear knapsack problem
0 references
Lagrangian relaxation
0 references
cutting plane
0 references
subgradient method
0 references
0 references
0.8844952583312988
0 references
0.8679282069206238
0 references
0.8334135413169861
0 references
0.7996360659599304
0 references
