Static stochastic Knapsack problems

DOI10.1017/S0269964815000170MaRDI QIDQ5358058zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The static stochastic knapsack problem with normally distributed item sizes
• scientific article; zbMATH DE number 1114460
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm

Cites work

• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• A Renewal Decision Problem
• A single-resource allocation problem with Poisson resource requirements
• Discrete life distributions with decreasing reversed hazard
• Dynamic programming algorithms for the zero-one knapsack problem
• Finite Horizon Stochastic Knapsacks with Applications to Yield Management
• scientific article; zbMATH DE number 1114460 (Why is no real title available?)
• scientific article; zbMATH DE number 1559582 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 3348831 (Why is no real title available?)
• scientific article; zbMATH DE number 3417266 (Why is no real title available?)
• Log-concave probability and its applications
• On two-stage stochastic knapsack problems
• Optimal project selection: Stochastic knapsack with finite time horizon
• Preference Order Stochastic Knapsack Problems: Methodological Issues
• Stochastic binary problems with simple penalties for capacity constraints violations
• Stochastic orders
• The adaptive Knapsack problem with stochastic rewards
• The dynamic and stochastic knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The static stochastic knapsack problem with normally distributed item sizes
• The stochastic knapsack problem
• The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm

Cited in

(12)

• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• Stochastic binary problems with simple penalties for capacity constraints violations
• An FPTAS for stochastic unbounded min-knapsack problem
• The adaptive Knapsack problem with stochastic rewards
• A stochastic linear knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• scientific article; zbMATH DE number 1114460 (Why is no real title available?)
• The Risk-Averse Static Stochastic Knapsack Problem
• scientific article; zbMATH DE number 5685026 (Why is no real title available?)
• The static stochastic knapsack problem with normally distributed item sizes
• Mixed-integer linear programming approximations for the stochastic knapsack
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm

This page was built for publication: Static stochastic Knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358058)