User menu

Lot-size Models With Backlogging - Strong Reformulations and Cutting Planes

Bibliographic reference Pochet, Yves ; Wolsey, Laurence. Lot-size Models With Backlogging - Strong Reformulations and Cutting Planes. In: Mathematical Programming, Vol. 40, no. 3, p. 317-335 (1988)
Permanent URL http://hdl.handle.net/2078.1/53136
  1. I. Barany, T.J. Van Roy and L.A. Wolsey, “Strong formulations for multi-item capacitated lot sizing,”Management Science 30 (10) (1984) 1255–1261.
  2. I. Barany, J. Edmonds and L.A. Wolsey, “Packing and covering a tree by subtrees,”Combinatorica 6, (1986) 221–233.
  3. P.S. Dixon and E.A. Silver, “A heuristic solution procedure for the multi-item, single-level, limited-capacity, lot-sizing problem,”J. Oper. Management 2 (1981) 23–39.
  4. G.D. Eppen and R.K. Martin, “Solving multi-item capacitated lot sizing problems using variable redefinition,” Graduate School of Business, University of Chicago, (1985).
  5. M. Grotschel, L. Lovasz and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (2) (1981) 169–197.
  6. N. Karmarkar, “A new polynomial time algorithm for linear programming,”Combinatorica 4 (4) (1984) 373–395.
  7. L.G. Khachian, “A polynomial algorithm in linear programming,”Soviet Math Dokl 20 (1979) 191–194.
  8. R.L. Rardin and V. Choe, “Tighter relaxations of fixed charge network flow problems,” Report ♯J-79-18, School of Industrial and Systems Engineering, Georgia Institute of Technology (1979).
  9. K. Rosling, “The dynamic inventory model and the uncapacitated facility location problem,” Linköping Institute of Technology, Department of Production Economics, S-58183 Linköping, Sweden, (1983).
  10. L.E. Schrage, “Implicit representation of variable upper bounds in linear programs,”Mathematical Programming Study 4 (1975) 118–132.
  11. J.M. Thizy and L.N. Van Wassenhove, “Decomposition algorithm for the multi-product lot-sizing problem with capacity constraints,”IIE Transactions (1986).
  12. T.J. Van Roy and L.A. Wolsey, “Solving mixed 0-1 programs by automatic reformulation,”Operations Research 35 (1987) 45–57.
  13. T.J. Van Roy and L.A. Wolsey, “Valid inequalities and separation for uncapacitated fixed cost networks,”Operations Research Letters 4 (3) (1985) 105–112.
  14. W.I. Zangwill, “A backlogging model and a multi-echelon model of a dynamic economic lot size production system—A network approach,”Management Science 15 (9) (1969) 506–527.
  15. W.I. Zangwill, “Minimum concave cost flows in certain networks,”Management Science 14 (7) (1968) 429–450.