Pages that link to "Item:Q5126622"
From MaRDI portal
The following pages link to Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622):
Displaying 7 items.
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Recursive lower and dual upper bounds for Bermudan-style options (Q2273928) (← links)
- Online Allocation and Pricing: Constant Regret via Bellman Inequalities (Q5003719) (← links)
- Procurement Mechanisms with Post-Auction Pre-Award Cost-Reduction Investigations (Q5060486) (← links)
- Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees (Q5106351) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
