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 ...

The theory of dynamic programming treats problems involving multi-stage processes by means of a transformation of the problem from the space of decisions to the space of functions. This is ...