scientific article

zbMath1297.90135MaRDI QIDQ2921694

Michel X. Goemans, Jan Vondrák, Brian C. Dean

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (28)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ Piecewise static policies for two-stage adjustable robust linear optimization ⋮ Submodular Stochastic Probing on Matroids ⋮ Adaptivity in the stochastic blackjack knapsack problem ⋮ Stochastic packing integer programs with few queries ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints ⋮ The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature ⋮ Randomized algorithms for online knapsack problems ⋮ The benefit of adaptivity in stochastic packing problems with probing ⋮ Stochastic Unsplittable Flows ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ Stochastic set packing problem ⋮ Optimal composition ordering problems for piecewise linear functions ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Unnamed Item ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Dynamic node packing ⋮ Scheduling with a processing time oracle ⋮ Adaptive Bin Packing with Overflow

This page was built for publication: