A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 760375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems |
scientific article; zbMATH DE number 760375 |
Statements
A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (English)
0 references
1 June 1995
0 references
branch and bound
0 references
separable convex quadratic knapsack
0 references
lower and upper bounds
0 references
reoptimization
0 references
0.9673474
0 references
0.96199244
0 references
0.95358485
0 references
0 references
0.9472426
0 references
0 references
0.9297681
0 references
0.9266633
0 references
0 references
