84 citations · 126 across the 21 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020★ 4 cited
An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem
Ali Aouad, Danny Segev
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…
cs.DS2020★ 1 cited
Approximation Algorithms for The Generalized Incremental Knapsack Problem
Yuri Faenza, Danny Segev, Lingyi Zhang
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 item…
cs.DS2020
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
Danny Segev, Sahil Singla
In this paper, we propose a general framework to design {efficient} polynomial time approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization problems. Gi…