RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive
Prikl. Diskr. Mat., 2010 Number 4(10), Pages 73–78 (Mi pdm257)
This article is cited 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

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.

UDC: 519.857


© Steklov Math. Inst. of RAS, 2024