We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of maximizing ...

The author introduces some basic dynamic programming techniques, using examples, with the help of the computer algebra system Maple. The emphasis is on building confidence and intuition for the ...

Let G be an acyclic directed graph with weights and values assigned to its vertices. In the partially ordered knapsack problem we wish to find a maximum-valued subset of vertices whose total weight ...