Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds

For a n-period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solution with O(n^2) variables and constraints, also giving an O(n^2)algorithm for the problem. This corrects and extends a formulation in Section 4.4 of our article "Lot-sizing with production and delivering time windows", Mathematical Programming A, 107: 741-489, 2006, for the problem with just stock upper bounds