A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm (Q3754439): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331938608843180 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048876360 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Numerical investigations on quadratic assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic for quadratic Boolean programs with applications to quadratic assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient branch and bound algorithm to solve the quadratic integer programming problem / rank | |||
Normal rank | |||
Latest revision as of 19:42, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm |
scientific article |
Statements
A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm (English)
0 references
1986
0 references
branch and bound
0 references
quadratic knapsack problem
0 references
