An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
From MaRDI portal
Publication:5136076
Recommendations
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- Extended formulations for stochastic lot-sizing problems
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Linear programming models for a stochastic dynamic capacitated lot sizing problem
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
Cites work
- A global chance-constraint for stochastic inventory systems under service level constraints
- A reformulation for the stochastic lot sizing problem with service-level constraints
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Constraint programming for computing non-stationary \((R, S)\) inventory policies
- Constraint programming for stochastic inventory systems under shortage cost
- Cost-based filtering techniques for stochastic inventory control under service level constraints
- Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
- On the number of segments needed in a piecewise linear approximation
- Optimal approximation of convex curves by functions which are piecewise linear
- Piecewise linear lower and upper bounds for the standard normal first order loss function
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
Cited in
(24)- Stochastic lot sizing problem with nervousness considerations
- A reformulation for the stochastic lot sizing problem with service-level constraints
- A polyhedral study of the static probabilistic lot-sizing problem
- The dynamic bowser routing problem
- Extended formulations for stochastic lot-sizing problems
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
- Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming
- Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy
- Fix and relax heuristic for a stochastic lot-sizing problem
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- Preprocessing techniques and column generation algorithms for stochastically efficient demand
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Comparison of different approaches to multistage lot sizing with uncertain demand
- Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation
- The stochastic inventory routing problem on electric roads
- Uncapacitated multi-item lot sizing with shipment minimization
- Perishable inventory control with backlogging penalties: a mixed-integer linear programming model via two-step approximation
- Multi-stage scenario-based stochastic programming for managing lot sizing and workforce scheduling at Vestel
- Stochastic production-distribution planning with transportation mode-dependent lead times
- Progressive hedging for multi-stage stochastic lot sizing problems with setup carry-over under uncertain demand
This page was built for publication: An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136076)
