News
We study the incremental knapsack problem, where one wishes to sequentially ... In contrast to earlier work, our algorithmic approach exploits an approximate dynamic programming formulation. Starting ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results