Geodesic
The assignment problem with possibility of applicants training
Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 1 (2013), pp. 85-94 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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.
Mots-clés : discrete optimisation, solution algorithm
Keywords: assignment problem, dual problem, Udzava method. 
@article{VSPUI_2013_1_a9,
     author = {O. A. Medvedeva},
     title = {The assignment problem with possibility of applicants training},
     journal = {Vestnik Sankt-Peterburgskogo universiteta. Prikladna\^a matematika, informatika, processy upravleni\^a},
     pages = {85--94},
     year = {2013},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSPUI_2013_1_a9/}
}
TY  - JOUR
AU  - O. A. Medvedeva
TI  - The assignment problem with possibility of applicants training
JO  - Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
PY  - 2013
SP  - 85
EP  - 94
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VSPUI_2013_1_a9/
LA  - ru
ID  - VSPUI_2013_1_a9
ER  - 
%0 Journal Article
%A O. A. Medvedeva
%T The assignment problem with possibility of applicants training
%J Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ
%D 2013
%P 85-94
%N 1
%U http://geodesic.mathdoc.fr/item/VSPUI_2013_1_a9/
%G ru
%F VSPUI_2013_1_a9
O. A. Medvedeva. The assignment problem with possibility of applicants training. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaâ matematika, informatika, processy upravleniâ, no. 1 (2013), pp. 85-94. http://geodesic.mathdoc.fr/item/VSPUI_2013_1_a9/

[1] Malyugina O. A., Medvedev S. N., Chernyshova G. D., “Komplektovanie shtatov pri nalichii obucheniya”, Sistemnoe modelirovanie sotsialno-ekonomicheskikh protsessov, Trudy 32-i Mezhdunar. shkoly-seminara, v. III, ed. V. G. Grebennikov, I. N. Shhepina, V. N. Jejtengon, eds. V. G. Grebennikov, I. N. Schepina, V. N. Eitengon, Izd-vo Voronezh. gos. un-ta, Voronezh, 2009, 425–427

[2] Burkard Rainer, Dell'Amico Mauro, Martello Silvano, Assignment problems, Printed in the United States of America, Society for Industrial and Applied Mathematics, Philadelphia, 2009, 382 pp. | MR | Zbl

[3] Maljugina O. A., Chernyshova G. D., “Ispol'zovanie zadachi o naznachenijah pri reshenii problemy formirovanija shtatov (The using of assignment problems for decision staff formation problems)”, Vestn. Voronezh. gos. un-ta (fakul'tet prikl. matematiki, informatiki i mehaniki), 2010, no. 8, 141–148

[4] Chernyshova G. D., Bulgakova I. N., Diskretnaja optimizacija (Discrete optimization), metod. posobie k kursu “Modeli i metody diskretnoj optimizacii”, Izd-vo Voronezh. gos. un-ta, Voronezh, 2007, 42 pp.

[5] Maljugina O. A., Medvedev S. N., Chernyshova G. D., “Ispol'zovanie dvojstvennyh metodov dlja reshenija odnoj mnogokriterial'noj zadachi o naznachenijah (The using of dual methods for the decision one multicriteria assignment problem)”, Vestn. Voronezh. gos. un-ta. Ser. Sistemnyj analiz i informacionnye tehnologii, 2010, no. 1, 31–34