Quick eVALUATION OF THE INTERVAL STABILITY OF THE LINEAR ASSIGNMENT problem SOLUTIONS
An efficient algorithm for evaluating the interval of solutions stability of opened and closed linear assignment problems based on a review of the results of optimization iterations is proposed. Economical one-step transition to the nearest vertex of the polytope of problem one for all the edges of...
Main Authors: | M. P. Revotjuk, M. K. Qaraleh, P. M. Batura |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
Subjects: | |
Online Access: | https://doklady.bsuir.by/jour/article/view/202 |
Similar Items
-
IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix
by: M. P. Revotjuk, et al.
Published: (2019-06-01) -
QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION
by: M. P. Revotjuk, et al.
Published: (2019-06-01) -
DIVERGENT SCHEMES FOR BACKLEY-LEVERETT PROBLEM APPLICATION
by: Yu. P. Krupnov
Published: (2019-06-01) -
About Some Localization Problems in Delaunay Triangulations
by: N. F. Dyshkant
Published: (2012-01-01) -
Численное решение двумерной задачи фильтрации жидкости в деформируемой пористой среде
by: Рудольф Александрович Вирц
Published: (2021-03-01)