Задача целочисленного сбалансирования трехмерной матрицы и алгоритмы ее решения
The article is devoted to the problem of integer-valued balancing of a three-dimensional matrix. The reduction of this problem to the problem of finding a maximum flow in the multiple network of integer-valued balancing and the algorithm for this problem are suggested. Also, the comparative characte...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2010-06-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/1030 |
Summary: | The article is devoted to the problem of integer-valued balancing of a three-dimensional matrix. The reduction of this problem to the problem of finding a maximum flow in the multiple network of integer-valued balancing and the algorithm for this problem are suggested. Also, the comparative characteristic of two algorithms of integer-valued bal¬ancing is made according to the results of the computing experiments. NP-completeness of the problem of integer-valued balancing of a three-dimensional matrix is proved in the article. The problem of minimization of the errors of rounding off in the problem of integer-valued balancing is explored. |
---|---|
ISSN: | 1818-1015 2313-5417 |