1 citations · 2 across the 3 of their papers we have counts for
4 papers
A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem
Guillermo Gallego, Danny Segev
In the adaptive ProbeMax problem, given a collection of mutually-independent random variables , our goal is to design an adaptive probing policy for sequentially…
Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers
Danny Segev
We consider a multi-stage stochastic optimization problem originally introduced by Cygan et al. (2013), studying how a single server should prioritize stochastically departing cust…
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…
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…