RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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


Avtomat. i Telemekh., 1974, Issue 9, Pages 104–110 (Mi at8485)  

This article is cited in 1 scientific paper (total in 1 paper)

Developing Systems

Solving the problem of minimal cut on a bi-connected orgraph by the branch-and-bound method

V. N. Burkov, V. O. Groppen

Moscow

Abstract: The results of an experimental study of various modifications of the branch-andbound method in solving the problem of minimal cut in a bi-connected orgraph are presented.

Full text: PDF file (1043 kB)

Document Type: Article
UDC: 621.3.06
Received: 25.02.1974

Citation: V. N. Burkov, V. O. Groppen, “Solving the problem of minimal cut on a bi-connected orgraph by the branch-and-bound method”, Avtomat. i Telemekh., 1974, no. 9, 104–110

Citation in format AMSBIB
\Bibitem{1}
\by V. N. Burkov, V. O. Groppen
\paper Solving the problem of minimal cut on a bi-connected orgraph by the branch-and-bound method
\jour Avtomat. i Telemekh.
\yr 1974
\issue 9
\pages 104--110
\mathnet{http://mi.mathnet.ru/at8485}


Linking options:
  • http://mi.mathnet.ru/eng/at8485
  • http://mi.mathnet.ru/eng/at/y1974/i9/p104

    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. V. O. Groppen, “Principles of reference-aided decision making”, Autom. Remote Control, 67:4 (2006), 660–675  mathnet  crossref  mathscinet  zmath
  • Avtomatika i Telemekhanika
    Number of views:
    This page:195
    Full text:21

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