Pages that link to "Item:Q2921694"

The following pages link to Adaptivity and approximation for stochastic packing problems (Q2921694):

Displaying 28 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
• Randomized algorithms for online knapsack problems (Q476887) (← links)
• The benefit of adaptivity in stochastic packing problems with probing (Q476898) (← links)
• When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
• Stochastic set packing problem (Q713096) (← links)
• Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
• Piecewise static policies for two-stage adjustable robust linear optimization (Q1646580) (← links)
• On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints (Q1717231) (← links)
• Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
• Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
• Dynamic node packing (Q2097666) (← links)
• Scheduling with a processing time oracle (Q2109845) (← links)
• Stochastic packing integer programs with few queries (Q2191766) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
• The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature (Q2445842) (← links)
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← links)
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity (Q3169009) (← links)
• Submodular Stochastic Probing on Matroids (Q3186541) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• Stochastic Unsplittable Flows (Q5002608) (← links)
• (Q5002731) (← links)
• (Q5002749) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• (Q5136319) (← links)
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
• Adaptive Bin Packing with Overflow (Q5870378) (← links)
• (Q5875506) (← links)