A study of the lot-sizing polytope

@article{Atamtrk2004ASO,
  title={A study of the lot-sizing polytope},
  author={Alper Atamt{\"u}rk and Juan Carlos Mu{\~n}oz},
  journal={Math. Program.},
  year={2004},
  volume={99},
  pages={443-465}
}
The lot–sizing polytope is a fundamental structure contained in many practical production planning problems. Here we study this polytope and identify facet–defining inequalities that cut off all fractional extreme points of its linear programming relaxation, as well as liftings from those facets. We give a polynomial– time combinatorial separation algorithm for the inequalities when capacities are constant. We also report on an extensive computational study on solving the lot– sizing problem… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Valid inequalities and separation for capacitated economic lot sizing

  • Y. Pochet
  • Operations Research Letters,
  • 1988
Highly Influential
4 Excerpts

Wolsey . bc – prod : a specialized branch – and – cut system for lot – sizing problems

  • A. L.
  • Management Science
  • 2000

bc–prod: a specialized branch–and–cut system for lot–sizing problems

  • G. Belvaux, L. A. Wolsey
  • Management Science,
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…