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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., 2008, Volume 15, Number 6, Pages 58–62 (Mi da557)  

This article is cited in 3 scientific papers (total in 3 papers)

Dynamic programming on Pareto sets

V. I. Struchenkov

Moscow State Institute of Radio-Engineering, Electronics and Automation (Technical University)

Abstract: The problem of optimal distribution of a resource is considered. A dynamic programming scheme is proposed. Instead of recurrent equations, stepwise computation of Pareto-optimal points is used on the plane of values of the goal function and resource. Practical realization demonstrates efficiency of this approach. Bibl. 2.

Keywords: dynamic programming, Pareto set.

Full text: PDF file (212 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2010, 4:3, 428–430

Bibliographic databases:

UDC: 519.857
Received: 27.05.2008
Revised: 23.09.2008

Citation: V. I. Struchenkov, “Dynamic programming on Pareto sets”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 58–62; J. Appl. Industr. Math., 4:3 (2010), 428–430

Citation in format AMSBIB
\Bibitem{Str08}
\by V.~I.~Struchenkov
\paper Dynamic programming on Pareto sets
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 6
\pages 58--62
\mathnet{http://mi.mathnet.ru/da557}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2543146}
\zmath{https://zbmath.org/?q=an:1249.90307}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 3
\pages 428--430
\crossref{https://doi.org/10.1134/S1990478910030154}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77956114944}


Linking options:
  • http://mi.mathnet.ru/eng/da557
  • http://mi.mathnet.ru/eng/da/v15/i6/p58

    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. I. Struchenkov, “Novye algoritmy optimalnogo raspredeleniya resursa”, PDM, 2010, no. 4(10), 73–78  mathnet
    2. Struchenkov V.I., “Novye algoritmy optimizatsii v zadachakh obespecheniya nadezhnosti slozhnykh sistem”, Informatsionnye tekhnologii, 2012, no. 11, 48–50  elib
    3. Yu. V. Bugaev, S. V. Chikunov, F. A. Muzalevskii, “Search for $C$-optimal routes in graphs”, Autom. Remote Control, 78:11 (2017), 2039–2050  mathnet  crossref  isi  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:838
    Full text:295
    References:55
    First page:12

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