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, 1985, Issue 12, Pages 79–84 (Mi at7657)  
Optimization of dynamic programming methods in the solution of extremal combinatorial problems

V. O. Groppen

Ordzhonikidze
Full-text PDF (802 kB)
Abstract: An approach is proposed whereby the realization of dinamic programming methods for extremal combinatorial problems is optimized. The optimization goal function minimizes the upperbound of the computation time or the computer memory size. Efficiency of the approach is illustrated with examples.

Received: 28.11.1984
Bibliographic databases:
Document Type: Article
UDC: 62-506, 519.83
Language: Russian
Citation: V. O. Groppen, “Optimization of dynamic programming methods in the solution of extremal combinatorial problems”, Avtomat. i Telemekh., 1985, no. 12, 79–84; Autom. Remote Control, 46 (1985), 1561–1566
Citation in format AMSBIB
\Bibitem{Gro85}
\by V.~O.~Groppen
\paper Optimization of dynamic programming methods in the solution of extremal combinatorial problems
\jour Avtomat. i Telemekh.
\yr 1985
\issue 12
\pages 79--84
\mathnet{http://mi.mathnet.ru/at7657}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=823131}
\zmath{https://zbmath.org/?q=an:0602.90108}
\transl
\jour Autom. Remote Control
\yr 1985
\vol 46
\pages 1561--1566
Linking options:
  • https://www.mathnet.ru/eng/at7657
  • https://www.mathnet.ru/eng/at/y1985/i12/p79
    • 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:93
    Full-text PDF :38
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024