Packing and covering a tree by subtrees
Combinatorica
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
Operations Research - Supplement
Improved algorithms for economic lot size problems
Operations Research
Polyhedra for lot-sizing with Wagner-Whitin costs
Mathematical Programming: Series A and B
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
Discrete Applied Mathematics
Lot-Sizing with Stock Upper Bounds and Fixed Charges
SIAM Journal on Discrete Mathematics
Note: A Note on "Lot-sizing with fixed charges on stocks: The convex hull"
Discrete Optimization
Hi-index | 0.00 |
In this paper, we examine a variant of the uncapacitated lot-sizing model of Wagner-Whitin that includes fixed charges on the stocks. Such a model is natural in a production environment where stocking is a complex operation, and appears as a subproblem in more general network design problems. Linear-programming formulations, a dynamic program, the convex hull of integer solutions and a separation algorithm are presented. All these turn out to be very natural extensions of the corresponding results of Barany et al. (Math. Programming Stud. 22 (1984) 32) for the uncapacitated lot-sizing problem. The convex hull proof is based on showing that an extended facility location formulation is tight and by projecting it onto the original space of variables.