|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2014, Volume 14, Issue 1, Pages 28–34
(Mi vngu324)
|
|
|
|
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
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 pseudopolynomially solvable and an algorithm for its solution is proposed.
Keywords:
complexity theory, logistics, dynamic programming, pseudopolynomial algorithm.
Received: 23.11.2012
Citation:
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
Linking options:
https://www.mathnet.ru/eng/vngu324 https://www.mathnet.ru/eng/vngu/v14/i1/p28
|
Statistics & downloads: |
Abstract page: | 170 | Full-text PDF : | 42 | References: | 41 | First page: | 4 |
|