The following pages link to (Q2934609):
Displaying 12 items.
- The update complexity of selection and related problems (Q315536) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
- The benefit of adaptivity in stochastic packing problems with probing (Q476898) (← links)
- Minimizing average flow-time under knapsack constraint (Q896150) (← links)
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature (Q2445842) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Algorithms for Queryable Uncertainty (Q4632163) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
