Publication:2934609
From MaRDI portal
zbMath1302.90179MaRDI QIDQ2934609
Publication date: 18 December 2014
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Algorithms for Queryable Uncertainty, Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms, Query minimization under stochastic uncertainty, The update complexity of selection and related problems, The robust knapsack problem with queries, Adaptivity in the stochastic blackjack knapsack problem, The benefit of adaptivity in stochastic packing problems with probing, Minimizing average flow-time under knapsack constraint, Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem, Two-stage robust optimization problems with two-stage uncertainty, The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature, Submodular Stochastic Probing on Matroids