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, 1979, Issue 11, Pages 134–141 (Mi at9574)  
Developing Systems

Efficiency analysis of combinatorial algorithms for search of extremal trees on weighted graphs

V. A. Kletin

Moscow
Full-text PDF (1623 kB)
Abstract: The problem of search for a minimal «partial» tree on a weighted oriented graph is formally stated. A branch-and-bound solution algorithm is described. Results are given of experimentally checking the efficiency of combinatorial programming methods for the problem.

Received: 19.01.1979
Bibliographic databases:
Document Type: Article
UDC: 519.14
Language: Russian
Citation: V. A. Kletin, “Efficiency analysis of combinatorial algorithms for search of extremal trees on weighted graphs”, Avtomat. i Telemekh., 1979, no. 11, 134–141; Autom. Remote Control, 40:11 (1980), 1664–1670
Citation in format AMSBIB
\Bibitem{Kle79}
\by V.~A.~Kletin
\paper Efficiency analysis of combinatorial algorithms for search of extremal trees on weighted graphs
\jour Avtomat. i Telemekh.
\yr 1979
\issue 11
\pages 134--141
\mathnet{http://mi.mathnet.ru/at9574}
\zmath{https://zbmath.org/?q=an:0439.90090}
\transl
\jour Autom. Remote Control
\yr 1980
\vol 40
\issue 11
\pages 1664--1670
Linking options:
  • https://www.mathnet.ru/eng/at9574
  • https://www.mathnet.ru/eng/at/y1979/i11/p134
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:105
    Full-text PDF :42
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024