A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space (Q2958350)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space |
scientific article |
Statements
A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space (English)
0 references
1 February 2017
0 references
combinatorial optimization
0 references
exact algorithm
0 references
space efficiency
0 references
generating function
0 references
