Quick eVALUATION OF THE INTERVAL STABILITY OF THE LINEAR ASSIGNMENT problem SOLUTIONS

Abstract

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 the optimal perfect matching is almost an order of magnitude reduces the computational complexity of evaluating the stability of the current optimal solution.

Keywords

• задача о назначении
• интервал устойчивости решения
• разностная схема
• вычислительная сложность