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 19 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)
• Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← 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)
• Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464) (← links)
• Rapid screening algorithms for stochastically constrained problems (Q2400026) (← links)
• A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints (Q2450736) (← links)
• Stochastic Shortest Path Problem with Delay Excess Penalty (Q2883605) (← links)
• On a stochastic bilevel programming problem (Q2892149) (← links)
• The Risk-Averse Static Stochastic Knapsack Problem (Q5085467) (← links)
• STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)