Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (Q2666932): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4821303 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the best choice of a branching variable in the subset sum problem / rank | |||
Normal rank | |||
Latest revision as of 06:43, 27 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal strategy for solving a special case of the knapsack problem by the branch and bound method |
scientific article |
Statements
Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (English)
0 references
23 November 2021
0 references
knapsack problem
0 references
branch and bound method
0 references
problem solution complexity
0 references
solution strategy
0 references
0 references
