Geodesic
Fractional vertices of the polyhedron of a~multi-index axial choice problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1999), pp. 65-70.

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

@article{IVM_1999_12_a7,
     author = {M. K. Kravtsov and E. V. Lukshin},
     title = {Fractional vertices of the polyhedron of a~multi-index axial choice problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {65--70},
     publisher = {mathdoc},
     number = {12},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1999_12_a7/}
}
TY  - JOUR
AU  - M. K. Kravtsov
AU  - E. V. Lukshin
TI  - Fractional vertices of the polyhedron of a~multi-index axial choice problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1999
SP  - 65
EP  - 70
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1999_12_a7/
LA  - ru
ID  - IVM_1999_12_a7
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%A E. V. Lukshin
%T Fractional vertices of the polyhedron of a~multi-index axial choice problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1999
%P 65-70
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1999_12_a7/
%G ru
%F IVM_1999_12_a7
M. K. Kravtsov; E. V. Lukshin. Fractional vertices of the polyhedron of a~multi-index axial choice problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1999), pp. 65-70. http://geodesic.mathdoc.fr/item/IVM_1999_12_a7/

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

[2] Emelichev V. A., Kravtsov M. K., “Poliedralnye aspekty mnogoindeksnykh aksialnykh transportnykh zadach”, Diskretn. matem., 3:2 (1991), 3–24

[3] Ilichev A. P., Shevchenko V. N., “O krainikh tochkakh mnogogrannikov mnogoindeksnykh transportnykh zadach”, Kombinatorno-algebraicheskie metody v prikl. matem., Gorkii, 1981, 66–72 | MR

[4] Even S., Itai A., Shamir A., “On the complexity of timetable and multicommodity flow problems”, SIAM J. Comput., 5:4 (1976), 691–703 | DOI | MR | Zbl

[5] Frieze A. M., “Complexity of a $3$-dimensional assignment problem”, European J. Oper. Research, 13:2 (1983), 161–164 | DOI | MR | Zbl

[6] Balas E., Saltzman M. J., “Facets of the three-index assignment polytope”, Discrete Appl. Math., 23:3 (1989), 201–229 | DOI | MR | Zbl

[7] Kravtsov M. K., “Diametr i radius transportnogo mnogogrannika”, DAN SSSR, 270:2 (1983), 278–281 | MR | Zbl

[8] Emelichev V. A., Kravtsov M. K., Krachkovskii A. P., “Transportnye mnogogranniki s maksimalnym chislom $k$-granei”, DAN SSSR, 282:4 (1985), 784–788 | MR | Zbl

[9] Kravtsov M. K., “Poliedralnye aspekty transportnykh zadach”, DAN SSSR, 309:2 (1989), 271–275 | MR

[10] Kravtsov M. K., “Poliedralnye aspekty mnogoindeksnykh transportnykh zadach s aksialnymi summami”, DAN SSSR, 315:6 (1990), 1298–1302 | MR

[11] Kravtsov M. K., “O transportnykh mnogogrannikakh s minimalnym chislom $k$-granei”, Diskretn. matem., 4:3 (1992), 108–117 | MR | Zbl

[12] Emelichev V. A., Kononenko A. M., “O chisle planov mnogoindeksnoi problemy vybora”, DAN BSSR, 18:8 (1974), 677–680 | MR | Zbl

[13] Leue O., “Methoden zur Lösung dreidimensionaler Zuordnungsprobleme”, Angewandte Informatik, 14:4 (1972), 154–162 | Zbl