Abstract
The knapsack problem is one of the "classical" problems in Operations Research. In this paper we present a number of APL codes based on the dynamic programming approach to such problems. Although these codes can be used effectively to solve small knapsack problems, they were developed primarily as teaching aids.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Sniedovich, M. (1994). Dynamic programming algorithms for the knapsack problem. ACM SIGAPL APL Quote Quad, 24(3), 18–21. https://doi.org/10.1145/181983.181988
Readers' Seniority
Readers' Discipline
