It is known that online knapsack is not competitive. This negative result remains true even if the items are removable. In this paper we consider online removable knapsack with
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...