Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2010, Volume 50, Number 5, Pages 836–847 (Mi zvmmf4874)  
Discrete optimization problems with interval parameters

V. A. Perepelitsa, F. B. Tebueva

Karachaevo-Cherkessk State Academy of Technology, Stavropol'skaya ul. 36, Cherkessk, 357100 Russia
Full-text PDF (236 kB)
References:
PDF
HTML
Abstract: Optimization problems on graphs with interval parameters are considered, and exponential and polynomial bounds for their computational complexity are obtained. For a certain subclass of polynomially solvable problems, two algorithms are proposed—one of them for finding an optimal solution and the other one for finding a suboptimal solution. Sufficient conditions for the statistical efficiency of the algorithm for finding a suboptimal solution are obtained.
Key words: discrete optimization problems with interval parameters, polynomial solvability, approximate algorithms.
Received: 27.02.2007
Revised: 04.12.2009
English version:
Computational Mathematics and Mathematical Physics, 2010, Volume 50, Issue 5, Pages 795–804
DOI: https://doi.org/10.1134/S0965542510050052
Bibliographic databases:
Document Type: Article
UDC: 519.626
Language: Russian
Citation: V. A. Perepelitsa, F. B. Tebueva, “Discrete optimization problems with interval parameters”, Zh. Vychisl. Mat. Mat. Fiz., 50:5 (2010), 836–847; Comput. Math. Math. Phys., 50:5 (2010), 795–804
Citation in format AMSBIB
\Bibitem{PerTeb10}
\by V.~A.~Perepelitsa, F.~B.~Tebueva
\paper Discrete optimization problems with interval parameters
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2010
\vol 50
\issue 5
\pages 836--847
\mathnet{http://mi.mathnet.ru/zvmmf4874}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2010CMMPh..50..795P}
\transl
\jour Comput. Math. Math. Phys.
\yr 2010
\vol 50
\issue 5
\pages 795--804
\crossref{https://doi.org/10.1134/S0965542510050052}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000279192400005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77952796865}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf4874
  • https://www.mathnet.ru/eng/zvmmf/v50/i5/p836
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024