|
Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya, 2013, Issue 1, Pages 85–94
(Mi vspui112)
|
|
|
|
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.
Accepted: October 25, 2012
Citation:
O. A. Medvedeva, “The assignment problem with possibility of applicants training”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2013, no. 1, 85–94
Linking options:
https://www.mathnet.ru/eng/vspui112 https://www.mathnet.ru/eng/vspui/y2013/i1/p85
|
Statistics & downloads: |
Abstract page: | 347 | Full-text PDF : | 817 | References: | 47 | First page: | 18 |
|