User menu

Polyhedra for Lot-sizing With Wagner-whitin Costs

Bibliographic reference Pochet, Yves ; Wolsey, Laurence. Polyhedra for Lot-sizing With Wagner-whitin Costs. In: Mathematical Programming, Vol. 67, no. 3, p. 297-323 (1994)
Permanent URL
  1. A. Aggarwal and J.K. Park, “Improved algorithms for economic lot size problems,”Operations Research 41 (1990) 549–571.
  2. E.H. Aghezzaf and L.A. Wolsey, “Lot-sizing polyhedra with a cardinality constraint,”Operations Research Letters 11 (1992) 13–18.
  3. I. Barany, T.J. Van Roy and L.A. Wolsey, “Uncapacitated lot-sizing: The convex hull of solutions,”Mathematical Programming Study 22 (1984) 32–43.
  4. A. Federgruen and M. Tzur, “A simple forward algorithm to solve general dynamic lot-sizing models inO(n logn) time,”Management Science 37 (1991) 909–925.
  5. L.R. Ford Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, 1962).
  6. C.P.M. van Hoesel, A.W.J. Kolen and A.P.M. Wagelmans, “A dual algorithm for the economic lot-sizing problem,”European Journal of Operations Research 52 (1991) 315–325.
  7. C.P.M. van Hoesel, A.P.M. Wagelmans and L.A. Wolsey, “Polyhedral characterisation of the economic lot-sizing problem with start-up costs,”SIAM Journal of Discrete Mathematics 7 (1994) 141–151.
  8. G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).
  9. Y. Pochet and L.A. Wolsey, “Lot-size models with backlogging: strong formulations and cutting planes,”Mathematical Programming 40 (1988) 317–335.
  10. Y. Pochet and L.A. Wolsey, “Lot-sizing with constant batches: formulation and valid inequalities,”Mathematics of Operations Research 18 (1993) 767–785.
  11. A.P.M. Wagelmans, C.P.M. van Hoesel and A.W.J. Kolen, “Economic lot-sizing: anO(n logn) algorithm that runs in linear time in Wagner—Whitin case,”Operations Research 40, supplement 1 (1992) 145–156.
  12. H.M. Wagner and T.M. Whitin, “A dynamic version of the economic lot size model,”Management Science 5 (1958) 89–96.