EXCHANGE ALGORITHM OF BIEXTREMAL SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEM

EXCHANGE ALGORITHM OF BIEXTREMAL SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEM

An effective algorithm of constructing optimal solutions to homogeneous allocation problems is developed. It is called a biextremal solution algorithm because it permits to find the distribution carrying an extremum to two popular distribution evaluations simultaneously: uniformity of distribution c...

Full description

Saved in:
Bibliographic Details
Main Authors: Rudolph A. Neydorf, Anton V. Filippov, Zafar Khangusein-ogly Yagubov
Format: Article
Language:Russian
Published: Don State Technical University 2011-06-01
Series:Advanced Engineering Research
Subjects:
algorithm
theory of scheduling
allocation problem
homogeneous system
optimization criterion
biextremal solution
permutable rule.
Online Access:https://www.vestnik-donstu.ru/jour/article/view/775
Tags: Add Tag
No Tags, Be the first to tag this record!
Login for hold and recall information

Internet

https://www.vestnik-donstu.ru/jour/article/view/775

Similar Items