Y Faenza, D Segev, L Zhang - Mathematical Programming, 2023 - Springer
We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack. In this setting, we are given a set of n items …
A Aouad, D Segev - Operations Research, 2023 - pubsonline.informs.org
We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of …
Abstract We consider the 0–1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot …
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 thesis, we propose and study discrete, multi-period extensions of classical packing problems, a fundamental class of models in combinatorial optimization. Those extensions …
F D'Onofrio, Y Faenza, L Zhang - arXiv preprint arXiv:2304.12967, 2023 - arxiv.org
We study incremental knapsack problems with profits given by a special class of monotone submodular functions, that we dub all-or-nothing. We show that these problems are not …
This Ph. D. thesis deals with two different classes of optimization problems: knapsack problems and tool switching problems. Knapsack problems became a classical and rich …