Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 1993, Issue 4, Pages 21–26 (Mi at2923)  
Deterministic Systems

Polyhedra with graphs of high density, and the polynomial solvability of combinatorial optimization problems

V. A. Bondarenko

Yaroslavl State University
Full-text PDF (1110 kB)

Received: 25.06.1992
Bibliographic databases:
Document Type: Article
UDC: 519.1
MSC: 90C27
Language: Russian
Citation: V. A. Bondarenko, “Polyhedra with graphs of high density, and the polynomial solvability of combinatorial optimization problems”, Avtomat. i Telemekh., 1993, no. 4, 21–26; Autom. Remote Control, 54:4 (1993), 541–545
Citation in format AMSBIB
\Bibitem{Bon93}
\by V.~A.~Bondarenko
\paper Polyhedra with graphs of high density, and the polynomial solvability of combinatorial optimization problems
\jour Avtomat. i Telemekh.
\yr 1993
\issue 4
\pages 21--26
\mathnet{http://mi.mathnet.ru/at2923}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1235677}
\zmath{https://zbmath.org/?q=an:0801.90094}
\transl
\jour Autom. Remote Control
\yr 1993
\vol 54
\issue 4
\pages 541--545
Linking options:
  • https://www.mathnet.ru/eng/at2923
  • https://www.mathnet.ru/eng/at/y1993/i4/p21
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024