An efficient multi-augmenting algorithm for the assignment problem

배정 문제에 대한 다중 부가경로 해법

In this paper, the assignment problem is considered. We propose an approach based on the solution of a sequence of shortest path sub-problem. We extend the cost reduction method, which is used for finding initial assignment, to solve these sub-problems. The use of the extended reduction method makes it possible to devise an efficient multi-augmenting algorithm.