Algorithm of logistic cost minimization under constraints on supply volumes

From MaRDI portal
Publication:5741346

DOI10.1007/S10958-015-2631-YzbMATH Open1349.90076arXiv1311.1055OpenAlexW1480821781MaRDI QIDQ5741346FDOQ5741346


Authors: N. I. Burlakova, V. V. Servakh Edit this on Wikidata


Publication date: 22 July 2016

Published in: Journal of Mathematical Sciences (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1311.1055




Recommendations




Cites Work


Cited In (6)





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)