View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...

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

In this paper, we extend the knapsack problem to include more realistic situations by treating the rewards (or values) associated with each item included in the solution as random variables with ...

This paper shows how branch-and-bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming criteria are used to ...

The number of available items is infinite (unbounded).<BR><BR>I've implemented a few of the usual solutions to this problem using recursion/memoization and dynamic programming but the solutions do ...