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



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Prikl. Diskr. Mat., 2010, Number 4(10), Pages 73–78 (Mi pdm257)  

Computational Methods in Discrete Mathematics

New algorithms for optimal resourse allocation

V. I. Struchenkov

Moscow State Institute of Radio-Engineering, Electronics and Automation, Moscow, Russia

Abstract: New algorithms for the optimal allocation of resources are suggested using Pareto sets and branch-and-bound method.

Keywords: optimal allocation of resources, Pareto set, branch-and-bound method.

Full text: PDF file (469 kB)
References: PDF file   HTML file
UDC: 519.857

Citation: V. I. Struchenkov, “New algorithms for optimal resourse allocation”, Prikl. Diskr. Mat., 2010, no. 4(10), 73–78

Citation in format AMSBIB
\Bibitem{Str10}
\by V.~I.~Struchenkov
\paper New algorithms for optimal resourse allocation
\jour Prikl. Diskr. Mat.
\yr 2010
\issue 4(10)
\pages 73--78
\mathnet{http://mi.mathnet.ru/pdm257}


Linking options:
  • http://mi.mathnet.ru/eng/pdm257
  • http://mi.mathnet.ru/eng/pdm/y2010/i4/p73

    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
  • Прикладная дискретная математика
    Number of views:
    This page:220
    Full text:67
    References:27

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