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

Diskretnyi Analiz i Issledovanie Operatsii

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor
	Guidelines for authors

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

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. Eremeev^a, A. A. Romanova^b, V. V. Servakh^a, S. S. Chauhan^c

^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

Full-text PDF (261 kB) Citations (10)

References:

PDF

HTML

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.

English version:
Journal of Applied and Industrial Mathematics, 2007, Volume 1, Issue 4, Pages 433–441
DOI: https://doi.org/10.1134/S1990478907040060

Bibliographic databases:

Language: Russian

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

Citation in format AMSBIB

\Bibitem{EreRomSer06}

\by A.~V.~Eremeev, A.~A.~Romanova, V.~V.~Servakh, S.~S.~Chauhan

\paper Approximation solution of the supply management problem

\jour Diskretn. Anal. Issled. Oper., Ser.~2

\yr 2006

\vol 13

\issue 1

\pages 27--39

\mathnet{http://mi.mathnet.ru/da16}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2288950}

\zmath{https://zbmath.org/?q=an:1249.90101}

\transl

\jour J. Appl. Industr. Math.

\yr 2007

\vol 1

\issue 4

\pages 433--441

\crossref{https://doi.org/10.1134/S1990478907040060}

\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-37249071815}

Linking options:

https://www.mathnet.ru/eng/da16

https://www.mathnet.ru/eng/da/v13/s2/i1/p27

This publication is cited in the following 10 articles:

Eremeev V A., Kovalyov M.Y., Kuznetsov P.M., “Lot-Size Scheduling of a Single Product on Unrelated Parallel Machines”, Optim. Lett., 14:3 (2020), 557–568
S. A. Malakh, V. V. Servakh, “Maximization of unit present profit in inventory management systems”, Autom. Remote Control, 81:5 (2020), 843–852
Corominas A., Lusa A., “Assigning Orders to Suppliers With Linear Piecewise Concave Costs”, J. Ind. Eng. Manag.-JIEM, 12:3 (2019), 421–431
Zaozerskaya L.A., Plankova V.A., Xii International Scientific and Technical Conference Applied Mechanics and Systems Dynamics, Journal of Physics Conference Series, 1210, IOP Publishing Ltd, 2019
Eremeev A., Kovalyov M., Kuznetsov P., “Single Product Lot-Sizing on Unrelated Parallel Machines With Non-Decreasing Processing Times”, Xi International Scientific and Technical Conference - Applied Mechanics and Dynamics Systems, Journal of Physics Conference Series, 944, IOP Publishing Ltd, 2018, UNSP 012032
Arda Yenipazarli, Harold P. Benson, Selcuk Erenguc, “A branch-and-bound algorithm for the concave cost supply problem”, International Journal of Production Research, 54:13 (2016), 3943
N. I. Burlakova, V. V. Servakh, “An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes”, J. Math. Sci., 211:6 (2015), 752–759
L. G. Afraimovich, M. Kh. Prilutskii, “Multiindex optimal production planning problems”, Autom. Remote Control, 71:10 (2010), 2145–2151
Borisovsky P., Dolgui A., Eremeev A., “Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder”, Eur. J. Oper. Res., 195:3 (2009), 770–779
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–1187

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Дискретный анализ и исследование операций

Statistics & downloads:
Abstract page:	558
Full-text PDF :	220
References:	87

Что такое QR-код?

Registration to the website

Logotypes