A single-resource allocation problem with Poisson resource requirements
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 436060 (Why is no real title available?)
- A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- Foundations of inventory management
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The dynamic and stochastic knapsack problem
- The sample average approximation method for stochastic discrete optimization
- The stochastic knapsack problem
Cited in
(6)- The static stochastic knapsack problem with normally distributed item sizes
- A multi-product continuous review inventory system in stochastic environment with budget constraint
- Static stochastic Knapsack problems
- Confidence-based reasoning in stochastic constraint programming
- The stochastic single resource service-provision problem
- Optimal allocation of stock levels and stochastic customer demands to a capacitated resource
This page was built for publication: A single-resource allocation problem with Poisson resource requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732784)