Geodesic
Investigation of polynomial algorithms for solving the three-index planar assignment problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 46 (2006) no. 2, pp. 222-228 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Under certain additional conditions imposed on the coefficients of the objective function in the three-index planar assignment problem, a large series of computational experiments aimed at the investigation of four polynomial algorithms for finding an asymptotically optimal solution of this problem is conducted. 
@article{ZVMMF_2006_46_2_a3,
     author = {S. A. Dichkovskaya and M. K. Kravtsov},
     title = {Investigation of polynomial algorithms for solving the three-index planar assignment problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {222--228},
     year = {2006},
     volume = {46},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_2_a3/}
}
TY  - JOUR
AU  - S. A. Dichkovskaya
AU  - M. K. Kravtsov
TI  - Investigation of polynomial algorithms for solving the three-index planar assignment problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2006
SP  - 222
EP  - 228
VL  - 46
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_2_a3/
LA  - ru
ID  - ZVMMF_2006_46_2_a3
ER  - 
%0 Journal Article
%A S. A. Dichkovskaya
%A M. K. Kravtsov
%T Investigation of polynomial algorithms for solving the three-index planar assignment problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2006
%P 222-228
%V 46
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_2_a3/
%G ru
%F ZVMMF_2006_46_2_a3
S. A. Dichkovskaya; M. K. Kravtsov. Investigation of polynomial algorithms for solving the three-index planar assignment problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 46 (2006) no. 2, pp. 222-228. http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_2_a3/

[1] Frieze A. M., “Complexity of a 3-dimensional assignment problem”, Europian J. Operat. Res., 13 (1983), 161–164 | DOI | MR | Zbl

[2] Burkard R. E., Frohlich K., “Some remarks on 3-dimensional assignment problems”, Methods of Operat. Res., 36 (1980), 31–36 | Zbl

[3] Balas E., Landweer P., “Traffic assignment in communication satellites”, Operat. Res., 2 (1983), 141–147 | Zbl

[4] Laywine C. F., Mullen G. L., Discrete mathematics using latin squares, John Wiley Sons, New York, 1998 | MR

[5] Magos D., Mourtos I., Appa G., Polyhedral results for assignment problems, CD AM Res. Rept LSE-CDAM-2002-01

[6] Euler R., Verge H. Le., “Time-tables, polyhedra and the greedy algorithm”, Discrete Appl. Math., 65 (1996), 207–221 | DOI | MR | Zbl

[7] Kravtsov M. K., Krachkovskii A. P., “Polinomialnyi algoritm dlya mnogoindeksnoi problemy vybora”, Zh. vychisl. matem. i matem. fiz., 39:6 (1999), 1041–1044 | MR | Zbl

[8] Kravtsov M. K., Krachkovskii A. P., “Asimptoticheskaya optimalnost plana transportnoi zadachi, postroennogo metodom minimalnogo elementa”, Kibernetika i sistemnyi analiz. Kiev, 1999, no. 1, 144–151 | MR | Zbl

[9] Kravtsov M. K., Krachkovskii A. P., “Asimptoticheskii podkhod k resheniyu mnogoindeksnoi aksialnoi transportnoi zadachi”, Zh. vychisl. matem. i matem. fiz., 38:7 (1998), 1133–1139 | MR | Zbl

[10] Kravtsov M. K., Krachkovskii A. P., “Asimptoticheskii podkhod k resheniyu mnogoindeksnoi aksialnoi problemy vybora”, Vestsi HAH Belarusi. Ser. fiz.-matem. navuk, 1999, no. 2, 123–126 | MR

[11] Kravtsov M. K., Krachkovskii A. P., “Zamechaniya k state “Polinomialnyi algoritm dlya mnogoindeksnoi problemy vybora””, Zh. vychisl. matem. i matem. fiz., 40:9 (2000), 1440 | MR | Zbl

[12] Kravtsov M. K., Krachkovskii A. P., “O polinomialnom algoritme nakhozhdeniya asimptoticheski optimalnogo resheniya trekhindeksnoi planarnoi problemy vybora”, Zh. vychisl. matem. i matem. fiz., 41:2 (2001), 342–345 | MR | Zbl

[13] Emelichev V. A., Kovalev M. M., Kravtsov M. K., Mnogogranniki, grafy, optimizatsiya, Nauka, M., 1981 | MR

[14] Dinits E. A., Kronrod M. A., “Odin algoritm resheniya zadachi o naznacheniyakh”, Dokl. AN SSSR, 189:1 (1969), 23–25

[15] Kravtsov M. K., Dichkovskaya C. A., “Asimptoticheskii podkhod k resheniyu mnogokriterialnoi trekhindeksnoi planarnoi problemy vybora”, Kibernetika i sistemnyi analiz, 2004, no. 3, 24–29 | MR | Zbl