A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem (Q4198334)
From MaRDI portal
scientific article; zbMATH DE number 3639445
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem |
scientific article; zbMATH DE number 3639445 |
Statements
A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem (English)
0 references
1979
0 references
boolean programming
0 references
Integer Programming
0 references
search process
0 references
estimation of the upper bound
0 references
m-constraint knapsack problem
0 references
balas method
0 references
generalized knapsack problem
0 references
branch and bound method
0 references
computational experience
0 references
algorithmic performance
0 references
comparison of algorithms
0 references
