RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Dokl. Akad. Nauk SSSR, 1979, Volume 244, Number 5, Pages 1093–1096 (Mi dan42319)  

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

MATHEMATICS

A polynomial algorithm in linear programming

L. G. Khachiyan

Computing Centre, USSR Academy of Sciences, Moscow

Full text: PDF file (452 kB)

Bibliographic databases:
UDC: 519.95
Presented: А. А. Дородницын
Received: 04.10.1978

Citation: L. G. Khachiyan, “A polynomial algorithm in linear programming”, Dokl. Akad. Nauk SSSR, 244:5 (1979), 1093–1096

Citation in format AMSBIB
\Bibitem{Kha79}
\by L.~G.~Khachiyan
\paper A polynomial algorithm in linear programming
\jour Dokl. Akad. Nauk SSSR
\yr 1979
\vol 244
\issue 5
\pages 1093--1096
\mathnet{http://mi.mathnet.ru/dan42319}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=0522052}
\zmath{https://zbmath.org/?q=an:0414.90086}


Linking options:
  • http://mi.mathnet.ru/eng/dan42319
  • http://mi.mathnet.ru/eng/dan/v244/i5/p1093

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. O. Slisenko, “Complexity problems in computational theory”, Russian Math. Surveys, 36:6 (1981), 23–125  mathnet  crossref  mathscinet  zmath  adsnasa  isi
    2. A. S. Asratyan, N. N. Kuzyurin, “Approximation of optima of integer programs of the packing–covering type”, Discrete Math. Appl., 10:1 (2000), 75–86  mathnet  crossref  mathscinet  zmath
    3. N. N. Kuzyurin, “Veroyatnostnye priblizhennye algoritmy v diskretnoi optimizatsii”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 9:2 (2002), 97–114  mathnet  mathscinet  zmath
    4. A. V. Proskurnikov, Yu. R. Romanovskii, “Regular triangulations of non-convex polytopes”, Russian Math. Surveys, 57:4 (2002), 817–818  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi
    5. M. Yu. Zvagel'skii, A. V. Proskurnikov, Yu. R. Romanovskii, “Regular triangulations and Steiner points”, St. Petersburg Math. J., 16:4 (2005), 673–690  mathnet  crossref  mathscinet  zmath
    6. A. S. Asratyan, N. N. Kuzyurin, “Analysis of the accuracy of randomized rounding for integer linear programming problems”, Discrete Math. Appl., 14:6 (2004), 543–554  mathnet  crossref  crossref  mathscinet  zmath
    7. V. A. Bereznev, “On the polynomial complexity of a modified simplex method”, Comput. Math. Math. Phys., 44:7 (2004), 1179–1193  mathnet  mathscinet
    8. Yu. S. Okulovskii, V. Yu. Popov, “On the complexity of recognizing a set of vectors by a neuron”, Siberian Adv. Math., 20:4 (2010), 293–300  mathnet  crossref  mathscinet
    9. R. S. Takhanov, “On the sample monotonization problem”, Comput. Math. Math. Phys., 50:7 (2010), 1260–1266  mathnet  crossref  mathscinet  adsnasa  isi
    10. L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman, “Otsenki srednego chisla iteratsii dlya algoritmov resheniya nekotorykh zadach buleva programmirovaniya”, Diskretn. analiz i issled. oper., 18:3 (2011), 49–64  mathnet  mathscinet  zmath
    11. A. V. Eremeev, Yu. V. Kovalenko, “O zadache sostavleniya raspisanii s gruppirovkoi mashin po tekhnologiyam”, Diskretn. analiz i issled. oper., 18:5 (2011), 54–79  mathnet  mathscinet  zmath
    12. V. A. Romankov, “Diofantova kriptografiya na beskonechnykh gruppakh”, PDM, 2012, no. 2(16), 15–42  mathnet
    13. N. V. Anashkina, A. N. Shurupov, “Primenenie algoritmov lokalnogo poiska k resheniyu sistem psevdobulevykh lineinykh neravenstv”, PDM. Prilozhenie, 2015, no. 8, 136–138  mathnet  crossref
    14. A. N. Shurupov, “Nekotorye strukturnye svoistva kvadratichnykh bulevykh porogovykh funktsii”, PDM. Prilozhenie, 2015, no. 8, 48–51  mathnet  crossref
    15. V. S. Kolosov, “Metod posledovatelnoi aktivatsii ogranichenii v lineinom programmirovanii”, PDM, 2018, no. 41, 110–125  mathnet  crossref
  • Number of views:
    This page:193
    Full text:98

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020