Adaptivity and approximation for stochastic packing problems
From MaRDI portal
Recommendations
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
- The benefit of adaptivity in stochastic packing problems with probing
- Stochastic packing integer programs with few queries
- Stochastic packing integer programs with few queries
Cited in
(35)- Piecewise static policies for two-stage adjustable robust linear optimization
- On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
- Improved online algorithm for fractional knapsack in the random order model
- Dynamic node packing
- Scheduling with a processing time oracle
- Stochastic packing integer programs with few queries
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Approximation algorithms for stochastic combinatorial optimization problems
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Submodular stochastic probing on matroids
- Stochastic Covering and Adaptivity
- Adaptivity in the stochastic blackjack knapsack problem
- Stochastic packing integer programs with few queries
- Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
- Randomized algorithms for online knapsack problems
- The benefit of adaptivity in stochastic packing problems with probing
- Stochastic unsplittable flows
- A PTAS for a class of stochastic dynamic programs
- Maximizing profit with convex costs in the random-order model
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- Approximation algorithms for stochastic k-TSP
- Maximizing expected utility for stochastic combinatorial optimization problems
- Improved approximation results for stochastic knapsack problems
- Adaptive Bin Packing with Overflow
- scientific article; zbMATH DE number 7650116 (Why is no real title available?)
- Adaptivity gaps for the stochastic Boolean function evaluation problem
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Correlated stochastic knapsack with a submodular objective
- Stochastic set packing problem
- Improved approximation factor for adaptive influence maximization via simple greedy strategies
- Optimal composition ordering problems for piecewise linear functions
- Composition orderings for linear functions and matrix multiplication orderings
This page was built for publication: Adaptivity and approximation for stochastic packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921694)
