caa a22 4500 605523118 CHVBK 20210128100748.0 cr unu---uuuuu 210128e20151201xx s 000 0 eng 10.1007/s10958-015-2631-y doi (NATIONALLICENCE)springer-10.1007/s10958-015-2631-y Algorithm of Logistic Cost Minimization Under Constraints on Supply Volumes [Elektronische Daten] [N. Burlakova, V. Servakh] We study the problem of minimization of the delivery and storage cost of some product under constraints on product volumes delivered from every supplier. We show that the problem is pseudopolynomially solvable and propose an algorithm for solving this problem. Bibliography: 7 titles. Springer Science+Business Media New York, 2015 Burlakova N. Omsk State University, 55a, Mira Pr, 644077, Omsk, Russia aut Servakh V. Omsk Branch of Sobolev Institute of Mathematics SB RAS, 13, Pevtsova St, 644099, Omsk, Russia aut Journal of Mathematical Sciences Springer US; http://www.springer-ny.com 211/6(2015-12-01), 752-759 1072-3374 211:6<752 2015 211 10958 https://doi.org/10.1007/s10958-015-2631-y text/html Onlinezugriff via DOI BK010053 XK010053 XK010000 Metadata rights reserved Springer special CC-BY-NC licence nationallicence 1 research-article jats NATIONALLICENCE NATIONALLICENCE NL-springer NATIONALLICENCE 856 40 https://doi.org/10.1007/s10958-015-2631-y text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Burlakova N. Omsk State University, 55a, Mira Pr, 644077, Omsk, Russia aut NATIONALLICENCE 700 1- Servakh V. Omsk Branch of Sobolev Institute of Mathematics SB RAS, 13, Pevtsova St, 644099, Omsk, Russia aut NATIONALLICENCE 773 0- Journal of Mathematical Sciences Springer US; http://www.springer-ny.com 211/6(2015-12-01), 752-759 1072-3374 211:6<752 2015 211 10958