A new lower bound for the linear knapsack problem with general integer variables (Q859686)
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: A new lower bound for the linear knapsack problem with general integer variables |
scientific article; zbMATH DE number 5116389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for the linear knapsack problem with general integer variables |
scientific article; zbMATH DE number 5116389 |
Statements
A new lower bound for the linear knapsack problem with general integer variables (English)
0 references
16 January 2007
0 references
discrete optimization
0 references
integer programming
0 references
knapsack problem
0 references
0.7954949736595154
0 references
0.7823228240013123
0 references
0.7820690870285034
0 references
