Algorithm of logistic cost minimization under constraints on supply volumes

From MaRDI portal
Publication:5741346




Abstract: A problem of minimization of delivery and storage costs of a product is considered under constraints on volumes of delivery from each of the suppliers. It is required to determine optimal volumes and times of product shipments. The problem is NP-hard. In this paper, the problem is proved to be pseudo-polynomially solvable and an algorithm for its solution is proposed.









This page was built for publication: Algorithm of logistic cost minimization under constraints on supply volumes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741346)