Geodesic
A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
Diskretnaya Matematika, Tome 12 (2000) no. 1, pp. 107-112 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

It is demonstrated that the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope given by integer vectors is not true. This research was supported by the Foundation for Basic Research of Republic Byelarus, grant $\Phi$97–266. 
@article{DM_2000_12_1_a8,
     author = {M. K. Kravtsov},
     title = {A~counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope},
     journal = {Diskretnaya Matematika},
     pages = {107--112},
     year = {2000},
     volume = {12},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2000_12_1_a8/}
}
TY  - JOUR
AU  - M. K. Kravtsov
TI  - A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
JO  - Diskretnaya Matematika
PY  - 2000
SP  - 107
EP  - 112
VL  - 12
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DM_2000_12_1_a8/
LA  - ru
ID  - DM_2000_12_1_a8
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%T A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
%J Diskretnaya Matematika
%D 2000
%P 107-112
%V 12
%N 1
%U http://geodesic.mathdoc.fr/item/DM_2000_12_1_a8/
%G ru
%F DM_2000_12_1_a8
M. K. Kravtsov. A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope. Diskretnaya Matematika, Tome 12 (2000) no. 1, pp. 107-112. http://geodesic.mathdoc.fr/item/DM_2000_12_1_a8/

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

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

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

[4] Kravtsov M.K., “Dokazatelstvo gipotezy Dyubua o maksimalnom chisle vershin simmetricheskogo transportnogo mnogogrannika”, Dokl. AN BSSR, 33:1 (1989), 9–12 | MR | Zbl

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

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

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

[8] Emelichev V. A., Kravtsov M. K., “O nekotorykh svoistvakh transportnykh mnogogrannikov s maksimalnym chislom vershin”, Dokl. AN SSSR, 228:5 (1976), 1025–1028 | MR | Zbl