An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (Q4661050): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2601698 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054083367 / rank | |||
Normal rank | |||
Latest revision as of 00:15, 20 March 2024
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
