The following pages link to (Q5365145):
Displaying 36 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← 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)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← 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)
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (Q2817835) (← links)
- (Q3795487) (← links)
- (Q4034270) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- (Q4941164) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- (Q5002731) (← links)
- (Q5053286) (← links)
- (Q5091069) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- (Q5136319) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- (Q5305223) (← links)
- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model (Q5425476) (← links)
- (Q5743496) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- (Q5875506) (← links)
- Stochastic Probing with Increasing Precision (Q6187078) (← links)
