The static stochastic knapsack problem with normally distributed item sizes
From MaRDI portal
Recommendations
Cites work
- A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
- A single-resource allocation problem with Poisson resource requirements
- Allocating Bandwidth for Bursty Connections
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Preference Order Stochastic Knapsack Problems: Methodological Issues
- Stochastic binary problems with simple penalties for capacity constraints violations
- Stochastic linear knapsack programming problem and its application to a portfolio selection problem
- Target market selection and marketing effort under uncertainty: the selective newsvendor
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- The inverse newsvendor problem: choosing an optimal demand portfolio for capacitated resources
- The sample average approximation method for stochastic discrete optimization
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
Cited in
(28)- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
- Integrated demand and procurement portfolio management with spot market volatility and option contracts
- Stochastic binary problems with simple penalties for capacity constraints violations
- Dynamic job assignment: a column generation approach with an application to surgery allocation
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Scheduling jobs with normally distributed processing times on parallel machines
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- The multi-Handler knapsack problem under uncertainty
- The dynamic and stochastic knapsack problem
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Robust optimization approach for a chance-constrained binary knapsack problem
- An adaptive stochastic knapsack problem
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- scientific article; zbMATH DE number 1114460 (Why is no real title available?)
- Heuristic policies for stochastic knapsack problem with time-varying random demand
- Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
- The Risk-Averse Static Stochastic Knapsack Problem
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- scientific article; zbMATH DE number 5685026 (Why is no real title available?)
- Static stochastic Knapsack problems
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
- Adjusted distributionally robust bounds on expected loss functions
- Model-based algorithms for the 0-1 time-bomb knapsack problem
- A single-resource allocation problem with Poisson resource requirements
- 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: The static stochastic knapsack problem with normally distributed item sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715062)
