A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (Q3220352): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56050294, #quickstatements; #temporary_batch_1707216511891 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 11:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem |
scientific article |
Statements
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem (English)
0 references
1984
0 references
knapsack problem
0 references
branch and bound
0 references
Subset-Sum Problem
0 references
depth-first tree search algorithm
0 references
randomly generated test problems
0 references
mixed algorithm
0 references
large sized problems
0 references
