Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
From MaRDI portal
Recommendations
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
- On formulations of the stochastic uncapacitated lot-sizing problem
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
- A polyhedral study of the static probabilistic lot-sizing problem
- Polynomial-time solvability of dynamic lot size problems
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
- A polynomial time algorithm for convex cost lot-sizing problems
- Approximation algorithms for the stochastic lot-sizing problem with order lead times
Cited in
(29)- An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model
- The stochastic lot-sizing problem with quantity discounts
- Single-item dynamic lot-sizing problems: an updated survey
- A polyhedral study of the static probabilistic lot-sizing problem
- Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem
- Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
- Extended formulations for stochastic lot-sizing problems
- A polynomial time algorithm for convex cost lot-sizing problems
- Dynamic capacitated lot sizing with random demand and dynamic safety stocks
- Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount
- Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy
- Robust formulations for economic lot-sizing problem with remanufacturing
- Dynamic lot sizing with stochastic demand timing
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
- Two-stage stochastic lot-sizing problem under cost uncertainty
- Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
- Basis paths and a polynomial algorithm for the multistage production-capacitated lot-sizing problem
- Stochastic lot-sizing with backlogging: computational complexity analysis
- 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 lot-sizing problem with deterministic demands and Wagner-Whitin costs
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- On a Multi-stage Stochastic Programming Model for Inventory Planning
- An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
- Partially adaptive multistage stochastic programming
- Stochastic dynamic lot-sizing with supplier-driven substitution and service level constraints
- On stochastic lot-sizing problems with random lead times
This page was built for publication: Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392239)
