Pages that link to "Item:Q3013933"

The following pages link to TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards (Q3013933):

Displaying 10 items.

• An adaptive stochastic knapsack problem (Q297367) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← 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)
• (Q5002731) (← links)
• Stochastic Knapsack Revisited: The Service Level Perspective (Q5080638) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
• STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)