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, 2003, Volume 10, Issue 1, Pages 3–10 (Mi da160)  

On the complexity of the solution of a class of integer linear programming problems

N. Yu. Zolotykh

N. I. Lobachevski State University of Nizhni Novgorod
References:
Received: 23.03.2003
Bibliographic databases:
UDC: 519.854.3
Language: Russian
Citation: N. Yu. Zolotykh, “On the complexity of the solution of a class of integer linear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:1 (2003), 3–10
Citation in format AMSBIB
\Bibitem{Zol03}
\by N.~Yu.~Zolotykh
\paper On the complexity of the solution of a class of integer linear programming problems
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2003
\vol 10
\issue 1
\pages 3--10
\mathnet{http://mi.mathnet.ru/da160}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2000837}
\zmath{https://zbmath.org/?q=an:1029.90041}
Linking options:
  • https://www.mathnet.ru/eng/da160
  • https://www.mathnet.ru/eng/da/v10/s2/i1/p3
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:357
    Full-text PDF :169
    References:44
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024