Pages that link to "Item:Q715062"

The following pages link to The static stochastic knapsack problem with normally distributed item sizes (Q715062):

Displaying 16 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• 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)
• Integrated demand and procurement portfolio management with spot market volatility and option contracts (Q1698897) (← links)
• Dynamic job assignment: a column generation approach with an application to surgery allocation (Q1991107) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
• Scheduling jobs with normally distributed processing times on parallel machines (Q2242242) (← links)
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
• The multi-Handler knapsack problem under uncertainty (Q2514753) (← 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)
• The Risk-Averse Static Stochastic Knapsack Problem (Q5085467) (← links)
• Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
• STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)