An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 1, pp. 28-34
Voir la notice de l'article provenant de la source Math-Net.Ru
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
Mots-clés : pseudopolynomial algorithm.
Mots-clés : pseudopolynomial algorithm.
@article{VNGU_2014_14_1_a2,
author = {N. I. Burlakova and V. V. Servakh},
title = {An {Algorithm} of {Logistic} {Costs} {Minimization} {Under} {Constraints} on {Supply} {Volumes}},
journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
pages = {28--34},
publisher = {mathdoc},
volume = {14},
number = {1},
year = {2014},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VNGU_2014_14_1_a2/}
}
TY - JOUR AU - N. I. Burlakova AU - V. V. Servakh TI - An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes JO - Sibirskij žurnal čistoj i prikladnoj matematiki PY - 2014 SP - 28 EP - 34 VL - 14 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VNGU_2014_14_1_a2/ LA - ru ID - VNGU_2014_14_1_a2 ER -
%0 Journal Article %A N. I. Burlakova %A V. V. Servakh %T An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes %J Sibirskij žurnal čistoj i prikladnoj matematiki %D 2014 %P 28-34 %V 14 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/VNGU_2014_14_1_a2/ %G ru %F VNGU_2014_14_1_a2
N. I. Burlakova; V. V. Servakh. An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 1, pp. 28-34. http://geodesic.mathdoc.fr/item/VNGU_2014_14_1_a2/