Learn More
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities , which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems vnth up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the(More)
  • 1