Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering (Q2399471)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering |
scientific article |
Statements
Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering (English)
0 references
23 August 2017
0 references
knapsack problem
0 references
branch-and-bound method
0 references
computational complexity
0 references
domination relation
0 references
0 references
