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