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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Upr.:
Year:
Volume:
Issue:
Page:
Find






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


Problemy Upravleniya, 2013, Issue 1, Pages 50–56 (Mi pu764)  

Control in the socio-economic systems

Optimal planning of renovation of railway line: formulation, algorithms for solving

Yu. O. Petrovetsab, D. L. Andrianovab

a Perm State National Research University
b PROGNOZ
References:
Abstract: The paper presents the long-term optimal control problem arising in planning of railway infrastructure renewal. The paper also considers the method of solving based on the idea of branch and bound algorithm using dynamic programming approach to obtain bounds.
Keywords: railway infrastructure; optimal planning; brunch and bound algorithm; dynamic programming.
Document Type: Article
UDC: 330.4
Language: Russian
Citation: Yu. O. Petrovets, D. L. Andrianov, “Optimal planning of renovation of railway line: formulation, algorithms for solving”, Probl. Upr., 2013, no. 1, 50–56
Citation in format AMSBIB
\Bibitem{PetAnd13}
\by Yu.~O.~Petrovets, D.~L.~Andrianov
\paper Optimal planning of renovation of railway line: formulation, algorithms for solving
\jour Probl. Upr.
\yr 2013
\issue 1
\pages 50--56
\mathnet{http://mi.mathnet.ru/pu764}
Linking options:
  • https://www.mathnet.ru/eng/pu764
  • https://www.mathnet.ru/eng/pu/v1/p50
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы управления
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024