A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383)
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 hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem |
scientific article; zbMATH DE number 777852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem |
scientific article; zbMATH DE number 777852 |
Statements
A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (English)
0 references
10 January 1996
0 references
integer programming
0 references
branch-and-bound method
0 references
numerical examples
0 references
dynamic programming
0 references
multiple-choice knapsack problem
0 references
Lagrangian duality
0 references
0 references
0 references
0 references
