An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (Q4661050)
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: An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem |
scientific article; zbMATH DE number 2151543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem |
scientific article; zbMATH DE number 2151543 |
Statements
An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (English)
0 references
4 April 2005
0 references
knapsack problem
0 references
branch and bound
0 references
combinatorial optimization
0 references
exact algorithm
0 references
0.8595923781394958
0 references
0.8220383524894714
0 references
0.788117527961731
0 references