Lower Bounds in Lot-Sizing Models: A Polyhedral Study

References

• Bitran G. R., Yanasse H. H. Computational complexity of the capacitated lotsizing problem. Management Sci. (1982) 28:1174–1186Link, Google Scholar
• Constantino M.A polyhedral approach to production planning models: Start-up costs and times, upper and lower bounds on production (1995) . Ph.D. thesis, Université Catholique de Louvain, BelgiumGoogle Scholar
• CPLEX Organization, Inc. Using the CPLEX Callable Library(Version. 3.0). (1994) (Incline Village, Nevada USA)Google Scholar
• Goemans M. X. Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Oper. Res. Lett. (1989) 8:315–322Crossref, Google Scholar
• Karp R. M., Miller, Thatcher. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 45–68Crossref, Google Scholar
• Lovasz L. Graph theory and integer programming. Ann. Discrete Math. (1979) 4:141–158Crossref, Google Scholar
• Martin R. K. Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. (1991) 10:119–128Crossref, Google Scholar
• Nemhauser G. L., Savelsbrgh M. W. P. Functional description of MINTO, a Mixed INTeger Optimizer, Version 2.0. (1994) (Georgia Institute of Technology, USA) Google Scholar
• Pochet Y., Wolsey L. A. Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. (1993) 18:767–785Link, Google Scholar
• Pochet Y., Wolsey L. A. Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Programming (1994) 67:297–323Crossref, Google Scholar
• Trigueiro W. W., Thomas L. J., McClain J. O. Capacitated lot-sizing with set-up times. Management Sci. (1989) 35:353–366Link, Google Scholar
• Van Roy T. J., Wolsey L. A. Valid inequalities for mixed 0-1 programs. Discrete Appl. Math. (1986) 14:199–213Crossref, Google Scholar