Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2009, Volume 21, Issue 3, Pages 3–13
DOI: https://doi.org/10.4213/dm1056 (Mi dm1056) 		 
This article is cited in 6 scientific papers (total in 6 papers)

On five types of stability of the lexicographic variant of the combinatorial bottleneck problem

E. E. Gurevskii, V. A. Emelichev
Full-text PDF (129 kB) Citations (6) English version article
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1056
Abstract: We consider the combinatorial vector minimax problem with ordered criteria. We formulate necessary and sufficient conditions for the five known types of stability of the problem which describe the behaviour of the lexicographic set with respect to perturbations of the initial data for the vector criterion.
Received: 28.08.2008
English version:
Discrete Mathematics and Applications, 2009, Volume 19, Issue 4, Pages 337–348
DOI: https://doi.org/10.1515/DMA.2009.022
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: E. E. Gurevskii, V. A. Emelichev, “On five types of stability of the lexicographic variant of the combinatorial bottleneck problem”, Diskr. Mat., 21:3 (2009), 3–13; Discrete Math. Appl., 19:4 (2009), 337–348
Citation in format AMSBIB
\Bibitem{GurEme09}
\by E.~E.~Gurevskii, V.~A.~Emelichev
\paper On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
\jour Diskr. Mat.
\yr 2009
\vol 21
\issue 3
\pages 3--13
\mathnet{http://mi.mathnet.ru/dm1056}
\crossref{https://doi.org/10.4213/dm1056}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2588648}
\elib{https://elibrary.ru/item.asp?id=20730296}
\transl
\jour Discrete Math. Appl.
\yr 2009
\vol 19
\issue 4
\pages 337--348
\crossref{https://doi.org/10.1515/DMA.2009.022}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-70350496576}
Linking options:
  • https://www.mathnet.ru/eng/dm1056
  • https://doi.org/10.4213/dm1056
  • https://www.mathnet.ru/eng/dm/v21/i3/p3
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:867
    Full-text PDF :333
    References:129
    First page:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026