Dynamic programming algorithms for the knapsack problem

Authors:
Moshe Sniedovich
Affiliations:
Department of Mathematics, The University of Melbourne, Parkville, Victoria 3052 Australia
Venue:
ACM SIGAPL APL Quote Quad
Year:
1994

Citing 4
Cited 1

Dynamic Programming

Dynamic Programming
Dynamic Programming: Models and Applications

Dynamic Programming: Models and Applications
Discrete Optimization Algorithms with Pascal Programs

Discrete Optimization Algorithms with Pascal Programs
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Awareness scheduling and algorithm implementation for collaborative virtual environment

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.