For Better Performance Please Use Chrome or Firefox Web Browser

Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount

Malekian, Y., Mirmohammadi, S. H., Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount. (2021), 134, 105373.

 

Journal Papers
Month/Season: 
Fall
Year: 
2021

تحت نظارت وف ایرانی