A new exact algorithm for concave knapsack problems with integer variables (Q5031798)
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 7474819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new exact algorithm for concave knapsack problems with integer variables |
scientific article; zbMATH DE number 7474819 |
Statements
A new exact algorithm for concave knapsack problems with integer variables (English)
0 references
16 February 2022
0 references
linear underestimation
0 references
special cut
0 references
contour cut
0 references
branch-and-bound
0 references
concave knapsack problem
0 references
0 references
0 references
0 references
0.8972316384315491
0 references
0.7946906685829163
0 references
0.7892681360244751
0 references
0.7864614129066467
0 references
0.7782005071640015
0 references
