RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., Ser. 2, 2006, Volume 13, Number 1, Pages 27–39 (Mi da16)  

This article is cited in 5 scientific papers (total in 5 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.

Full text: PDF file (261 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2007, 1:4, 433–441

Bibliographic databases:


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://www.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{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-37249071815}


Linking options:
  • http://mi.mathnet.ru/eng/da16
  • http://mi.mathnet.ru/eng/da/v13/s2/i1/p27

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


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

    This publication is cited in the following articles:
    1. 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  mathnet  crossref  mathscinet  zmath  isi
    2. 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  crossref  zmath  isi  elib  scopus
    3. L. G. Afraimovich, M. Kh. Prilutskii, “Multiindex optimal production planning problems”, Autom. Remote Control, 71:10 (2010), 2145–2151  mathnet  crossref  mathscinet  zmath  isi
    4. 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  mathnet  crossref
    5. 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  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:378
    Full text:166
    References:48

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020