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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results