Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact algorithm for concave knapsack problems: linear underestimation and partition method |
scientific article; zbMATH DE number 5000083
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithm for concave knapsack problems: linear underestimation and partition method |
scientific article; zbMATH DE number 5000083 |
Statements
Exact algorithm for concave knapsack problems: linear underestimation and partition method (English)
0 references
23 January 2006
0 references
concave knapsack problem
0 references
domain cut
0 references
domain partition
0 references
linear underestimation
0 references
nonlinear integer programming
0 references
0 references
0 references
0 references
0 references
