Informatics

The assignment problem with possibility of applicants training

O. A. Medvedeva

Voronezh State University

Abstract: The assignment problem with possibility of applicants training is considered. Two decision algorithms are suggested. The first one is heuristic and assumes repetition of the Hungarian method procedure. At the basis of the second exact algorithm there lies transition to a dual problem with the subsequent use of Udzava method. Bibliogr. 5.

Keywords: discrete optimisation, assignment problem, solution algorithm, dual problem, Udzava method.

UDC: 519.112.71


Accepted: October 25, 2012