Pages that link to "Item:Q993710"

The following pages link to Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710):

Displaying 8 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• An adaptive stochastic knapsack problem (Q297367) (← links)
• Stochastic nonlinear resource allocation problem (Q325428) (← links)
• On two-stage stochastic knapsack problems (Q643023) (← links)
• The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• A second-order cone programming approach for linear programs with joint probabilistic constraints (Q1758269) (← links)