1999•ComputingRequires access
Dynamic Programming Revisited: Improving Knapsack Algorithms
Ulrich Pferschy
Open publisher page 53 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Ulrich Pferschy
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 53 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Knapsack problem, Dynamic programming, Continuous knapsack problem, Change-making problem, Bounded function, Polynomial-time approximation scheme, Cutting stock problem, Mathematical optimization