A new enumeration scheme for the knapsack problem (Q1095029): Difference between revisions
From MaRDI portal
Revision as of 12:25, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new enumeration scheme for the knapsack problem |
scientific article |
Statements
A new enumeration scheme for the knapsack problem (English)
0 references
1987
0 references
This paper presents a new enumeration scheme to solve the one-dimensional knapsack problem motivated by some observations on number theory, more specifically on the determination of the number of solutions of linear diophantine equations. This new algorithm is pseudopolynomial and its special features provide a reduction in running time and in the computational memory requirements as compared with other exact (dynamic programming) methods.
0 references
enumeration
0 references
one-dimensional knapsack problem
0 references
linear diophantine equations
0 references
pseudopolynomial
0 references
0 references
0 references
