Pages that link to "Item:Q3169009"

The following pages link to Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity (Q3169009):

Displaying 50 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
• The stochastic generalized bin packing problem (Q423955) (← links)
• Toward a model for backtracking and dynamic programming (Q430838) (← 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)
• Prioritized interdiction of nuclear smuggling via tabu search (Q895756) (← links)
• On the adaptivity gap of stochastic orienteering (Q896283) (← links)
• Robust execution strategies for project scheduling with unreliable resources and stochastic durations (Q906557) (← links)
• A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
• Improved bounds in stochastic matching and optimization (Q1755741) (← links)
• Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
• Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
• Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
• Dynamic node packing (Q2097666) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
• Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
• Stochastic packing integer programs with few queries (Q2191766) (← links)
• An adversarial model for scheduling with testing (Q2211361) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
• Narrowing the search for optimal call-admission policies via a nonlinear stochastic knapsack model (Q2342132) (← 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)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• Submodular Stochastic Probing on Matroids (Q3186541) (← links)
• Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
• Polymatroid Prophet Inequalities (Q3452806) (← links)
• Ignorant vs. Anonymous Recommendations (Q3452859) (← links)
• Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• Stochastic Unsplittable Flows (Q5002608) (← links)
• (Q5053286) (← links)
• Stochastic Knapsack Revisited: The Service Level Perspective (Q5080638) (← links)
• The Risk-Averse Static Stochastic Knapsack Problem (Q5085467) (← links)
• Stochastic graph exploration (Q5092339) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
• Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries (Q5130481) (← links)
• Adaptive Submodular Ranking and Routing (Q5130512) (← links)
• (Q5136319) (← links)
• Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)