|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, 2006, Volume 13, Issue 1, Pages 27–39
(Mi da16)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Approximation solution of the supply management problem
A. V. Eremeeva, A. A. Romanovab, V. V. Servakha, S. S. Chauhanc a Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science
b Omsk State University
c The Paul Verlaine University in Metz
Abstract:
The problem is considered of optimizing the product delivery from suppliers to consumers. The size of each open supply is bounded both below and above, the size of consumption for each consumer is bounded below, the supply cost functions are linear for nonzero volumes of supply. A fully polynomial time approximation scheme is proposed for this problem in the case of one consumer, and the complexity of the problem is studied in the general case.
Citation:
A. V. Eremeev, A. A. Romanova, V. V. Servakh, S. S. Chauhan, “Approximation solution of the supply management problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006), 27–39; J. Appl. Industr. Math., 1:4 (2007), 433–441
Linking options:
https://www.mathnet.ru/eng/da16 https://www.mathnet.ru/eng/da/v13/s2/i1/p27
|
Statistics & downloads: |
Abstract page: | 515 | Full-text PDF : | 207 | References: | 72 |
|