Geodesic
On a generalization of the minimax assignment problem
Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 4, pp. 36-43.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2004_11_4_a2,
     author = {N. I. Glebov},
     title = {On a generalization of the minimax assignment problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {36--43},
     publisher = {mathdoc},
     volume = {11},
     number = {4},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2004_11_4_a2/}
}
TY  - JOUR
AU  - N. I. Glebov
TI  - On a generalization of the minimax assignment problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2004
SP  - 36
EP  - 43
VL  - 11
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2004_11_4_a2/
LA  - ru
ID  - DA_2004_11_4_a2
ER  - 
%0 Journal Article
%A N. I. Glebov
%T On a generalization of the minimax assignment problem
%J Diskretnyj analiz i issledovanie operacij
%D 2004
%P 36-43
%V 11
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2004_11_4_a2/
%G ru
%F DA_2004_11_4_a2
N. I. Glebov. On a generalization of the minimax assignment problem. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 4, pp. 36-43. http://geodesic.mathdoc.fr/item/DA_2004_11_4_a2/

[1] Dinits E. A., “O reshenii dvukh zadach o naznachenii”, Issledovaniya po diskretnoi optimizatsii, Nauka, M., 1976, 333–348

[2] Burkard R. E., “Selected topics on assignment problems”, Discrete Appl. Math., 123:1–3 (2002), 257–302 | DOI | MR | Zbl

[3] Pferschy U., “Solution methods and computational investigations for the linear bottleneck assignment problem”, Computing, 59:3 (1997), 237–258 | DOI | MR | Zbl