Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2014, Volume 14, Issue 1, Pages 28–34
An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes
N. I. Burlakovaa, V. V. Servakhb
a Omsk State University
b Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
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 pseudopolynomially solvable and an algorithm for its solution is proposed.
complexity theory, logistics, dynamic programming, pseudopolynomial algorithm.
PDF file (221 kB)
Journal of Mathematical Sciences, 2015, 211:6, 752–759
N. I. Burlakova, V. V. Servakh, “An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:1 (2014), 28–34; J. Math. Sci., 211:6 (2015), 752–759
Citation in format AMSBIB
\by N.~I.~Burlakova, V.~V.~Servakh
\paper An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes
\jour Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform.
\jour J. Math. Sci.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|