After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

We investigate the online variant of the (Multiple) Knapsack Problem: an algorithm is to pack
items, of arbitrary sizes and profits, in k knapsacks (bins) without exceeding the capacity of …

We study the problem of packing a knapsack without knowing its capacity. Whenever we
attempt to pack an item that does not fit, the item is discarded; if the item fits, we have to …

We propose a new variant of the standard online knapsack problem where the only
information missing to the provided instances is the capacity B of the knapsack. We refer to …

This paper examines two-sided matching with budget constraints where one side (a firm or
hospital) can make monetary transfers (offer wages) to the other (a worker or doctor). In a …

Knapsack problems are among the most fundamental problems in optimization. In the
Multiple Knapsack problem, we are given multiple knapsacks with different capacities and …

Online graph problems are considered in models where the irrevocability requirement is
relaxed. We consider the Late Accept model, where a request can be accepted at a later …

Online graph problems are considered in models where the irrevocability requirement is
relaxed. Motivated by practical examples where, for example, there is a cost associated with …

Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …

In this paper, we address an online knapsack problem under concave function f (x), ie, an
item with size x has its profit f (x). We first obtain a simple lower bound\max {q, f'(0) f (1)\} …