Nir Halman, Giacomo Nannicini, “Fully polynomial time $(\Sigma ,\Pi )$-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs”, Math. Program., 195, № 1-2, 2022, 183
A Eremeev, M Kovalyov, P Kuznetsov, “Single product lot-sizing on unrelated parallel machines with non-decreasing processing times”, J. Phys.: Conf. Ser., 944, 2018, 012032
D.R. Goossens, A.J.T. Maas, F.C.R. Spieksma, J.J. van de Klundert, “Exact algorithms for procurement problems under a total quantity discount structure”, European Journal of Operational Research, 178, № 2, 2007, 603
Dries Goossens, Frits C. R. Spieksma, “The transportation problem with exclusionary side constraints”, 4OR-Q J Oper Res, 7, № 1, 2009, 51
A. V. Eremeev, M. Ya. Kovalyov, P. M. Kuznetsov, “Approximate solution of the control problem of supplies with many intervals and concave cost functions”, Autom Remote Control, 69, № 7, 2008, 1181
P. Borisovsky, A. Dolgui, A. Eremeev, “Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder”, European Journal of Operational Research, 195, № 3, 2009, 770
N. I. Burlakova, V. V. Servakh, “Algorithm of Logistic Cost Minimization Under Constraints on Supply Volumes”, J Math Sci, 211, № 6, 2015, 752
Nir Halman, Diego Klabjan, Chung-Lun Li, James Orlin, David Simchi-Levi, “Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs”, SIAM J. Discrete Math., 28, № 4, 2014, 1725
L A Zaozerskaya, V A Plankova, “Researching and solving a bicriteria supply management problem with the given volumes of batches”, J. Phys.: Conf. Ser., 1210, 2019, 012164
Lidia A. Zaozerskaya, “Analysis of Fractional Covering of Some Supply Management Problems”, J Math Model Algor, 5, № 2, 2006, 201