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.
Recommendations
- Approximate solution of the control problem of supplies with many intervals and concave cost functions
- Approximation solution of the supply management problem
- scientific article; zbMATH DE number 1189258
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- scientific article; zbMATH DE number 1488159
Cites work
Cited in
(6)- scientific article; zbMATH DE number 1189258 (Why is no real title available?)
- Approximation solution of the supply management problem
- Minimizing logistic costs in multistage supply chains
- A computational method for pricing of delivery service in a logistics network
- Approximate solution of the control problem of supplies with many intervals and concave cost functions
- A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost
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)