STATIC STOCHASTIC KNAPSACK PROBLEMS

DOI10.1017/S0269964815000170zbMath1370.90207OpenAlexW2468477307MaRDI QIDQ5358058

Kai Chen, Sheldon M. Ross

Publication date: 19 September 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964815000170

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (1)

A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two-stage stochastic knapsack problems
• The static stochastic knapsack problem with normally distributed item sizes
• A single-resource allocation problem with Poisson resource requirements
• Stochastic orders
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• Dynamic programming algorithms for the zero-one knapsack problem
• Stochastic binary problems with simple penalties for capacity constraints violations
• Log-concave probability and its applications
• The Dynamic and Stochastic Knapsack Problem
• TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• Optimal project selection: Stochastic knapsack with finite time horizon
• The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The stochastic knapsack problem
• Preference Order Stochastic Knapsack Problems: Methodological Issues
• A Renewal Decision Problem
• Finite Horizon Stochastic Knapsacks with Applications to Yield Management

This page was built for publication: STATIC STOCHASTIC KNAPSACK PROBLEMS