A hybrid algorithm for the unbounded knapsack problem (Q1013302): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 01:48, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid algorithm for the unbounded knapsack problem |
scientific article |
Statements
A hybrid algorithm for the unbounded knapsack problem (English)
0 references
17 April 2009
0 references
branch and bound
0 references
dynamic programming
0 references
algorithm engineering
0 references
