Prikladnaya Diskretnaya Matematika
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

Prikladnaya Diskretnaya Matematika, 2010, Number 4(10), Pages 73–78 (Mi pdm257)  
This article is cited in 1 scientific paper (total in 1 paper)

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
Full-text PDF (469 kB) Citations (1)
References:
PDF
HTML
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.
Document Type: Article
UDC: 519.857
Language: Russian
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:
  • https://www.mathnet.ru/eng/pdm257
  • https://www.mathnet.ru/eng/pdm/y2010/i4/p73
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:324
    Full-text PDF :96
    References:45
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024