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, 1997, Volume 4, Issue 2, Pages 23–33 (Mi da420)  

This article is cited in 7 scientific papers (total in 7 papers)

A polynomially solvable class of two-level linear programming problems

Yu. A. Kochetov, A. V. Plyasunov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Received: 25.03.1996
Bibliographic databases:
UDC: 519.854
Language: Russian
Citation: Yu. A. Kochetov, A. V. Plyasunov, “A polynomially solvable class of two-level linear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 4:2 (1997), 23–33
Citation in format AMSBIB
\Bibitem{KocPly97}
\by Yu.~A.~Kochetov, A.~V.~Plyasunov
\paper A~polynomially solvable class of two-level linear programming problems
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 1997
\vol 4
\issue 2
\pages 23--33
\mathnet{http://mi.mathnet.ru/da420}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1659028}
Linking options:
  • https://www.mathnet.ru/eng/da420
  • https://www.mathnet.ru/eng/da/v4/s2/i2/p23
  • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:656
    Full-text PDF :160
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024