Pages that link to "Item:Q2817835"
From MaRDI portal
The following pages link to Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835):
Displaying 11 items.
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Dynamic node packing (Q2097666) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- Stochastic Knapsack Revisited: The Service Level Perspective (Q5080638) (← links)
- (Q5091069) (← 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)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
