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, Ser. 2, 2001, Volume 8, Issue 2, Pages 52–72 (Mi da247)  
A new approximate algorithm for solving a positive linear programming problem

S. A. Fomin

Institute for System Programming, Russian Academy of Sciences
Full-text PDF (1866 kB)
Received: 13.01.2000
Bibliographic databases:
UDC: 519.852
Language: Russian
Citation: S. A. Fomin, “A new approximate algorithm for solving a positive linear programming problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:2 (2001), 52–72
Citation in format AMSBIB
\Bibitem{Fom01}
\by S.~A.~Fomin
\paper A~new approximate algorithm for solving a~positive linear programming problem
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2001
\vol 8
\issue 2
\pages 52--72
\mathnet{http://mi.mathnet.ru/da247}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1918219}
\zmath{https://zbmath.org/?q=an:1025.90008}
Linking options:
  • https://www.mathnet.ru/eng/da247
  • https://www.mathnet.ru/eng/da/v8/s2/i2/p52
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:284
    Full-text PDF :136
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024