Lot-sizing with constant batches: formulation and valid inequalities
Mathematics of Operations Research
Polyhedra for lot-sizing with Wagner-Whitin costs
Mathematical Programming: Series A and B
A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty
Journal of Global Optimization
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Mathematical Programming: Series A and B
Sequential pairing of mixed integer inequalities
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
Discrete Applied Mathematics
Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
Operations Research Letters
Operations Research Letters
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
Operations Research
Hi-index | 0.00 |
We consider two formulations of a stochastic uncapacitated lot-sizing problem. We show that by adding (@?,S) inequalities to the one with the smaller number of variables, both formulations give the same LP bound. Then we show that for two-period problems, adding another class of inequalities gives the convex hull of integral solutions.