Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
Keywords: برنامه ریزی عدد صحیح; Integer programming; Single-item capacitated lot sizing problem; Flow cover inequalities; Cutting plane algorithm