39 search results - page 1 / 8 » Online Knapsack Revisited |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
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
IOR
2008
13 years 5 months ago
2008
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...
EVOW
2009
Springer
13 years 2 months ago
2009
Springer
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...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
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...
ANOR
2007
13 years 5 months ago
2007
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...