Pages that link to "Item:Q974983"

The following pages link to A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983):

Displaying 24 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• Gamma distribution approach in chance-constrained stochastic programming model (Q366033) (← links)
• Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
• Piecewise static policies for two-stage adjustable robust linear optimization (Q1646580) (← links)
• Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
• On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints (Q1717231) (← links)
• Lifting of probabilistic cover inequalities (Q1728321) (← links)
• Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
• A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
• The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature (Q2445842) (← links)
• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
• A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation (Q2688910) (← links)
• Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints (Q2806828) (← links)
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• (Q5091069) (← links)
• Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)