Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
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, 2008, Volume 15, Issue 3, Pages 22–30 (Mi da531)  
This article is cited in 3 scientific papers (total in 3 papers)

On decentralized transportation problem

V. T. Dement'ev, A. V. Pyatkin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (248 kB) Citations (3)
References:
PDF
HTML
Abstract: A decentralized transportation problem is considered, where the customers act individually maximizing their own profit, while the producer can only determine the sequence of their service. It is shown that this problem is NP-hard. An aproximate polynomial algorithm with a guaranteed ratio is proposed in the case of the same demand values. Bibl. 3.
Keywords: transportation problem, bilevel programming, algorithmic complexity, NP-completeness, approximate algorithm.
Received: 10.10.2007
Revised: 03.03.2008
English version:
Journal of Applied and Industrial Mathematics, 2009, Volume 3, Issue 1, Pages 32–37
DOI: https://doi.org/10.1134/S1990478909010050
Bibliographic databases:
UDC: 519.87+519.854
Language: Russian
Citation: V. T. Dement'ev, A. V. Pyatkin, “On decentralized transportation problem”, Diskretn. Anal. Issled. Oper., 15:3 (2008), 22–30; J. Appl. Industr. Math., 3:1 (2009), 32–37
Citation in format AMSBIB
\Bibitem{DemPya08}
\by V.~T.~Dement'ev, A.~V.~Pyatkin
\paper On decentralized transportation problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 3
\pages 22--30
\mathnet{http://mi.mathnet.ru/da531}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2542322}
\zmath{https://zbmath.org/?q=an:1249.90159}
\transl
\jour J. Appl. Industr. Math.
\yr 2009
\vol 3
\issue 1
\pages 32--37
\crossref{https://doi.org/10.1134/S1990478909010050}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-63349101806}
Linking options:
  • https://www.mathnet.ru/eng/da531
  • https://www.mathnet.ru/eng/da/v15/i3/p22
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:469
    Full-text PDF :134
    References:37
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024