Geodesic
On new properties of the maximum noninteger vertices of the polytope in the three-index axial assignment problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2004), pp. 37-45 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_2004_12_a3,
     author = {V. M. Kravtsov},
     title = {On new properties of the maximum noninteger vertices of the polytope in the three-index axial assignment problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {37--45},
     year = {2004},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2004_12_a3/}
}
TY  - JOUR
AU  - V. M. Kravtsov
TI  - On new properties of the maximum noninteger vertices of the polytope in the three-index axial assignment problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2004
SP  - 37
EP  - 45
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/IVM_2004_12_a3/
LA  - ru
ID  - IVM_2004_12_a3
ER  - 
%0 Journal Article
%A V. M. Kravtsov
%T On new properties of the maximum noninteger vertices of the polytope in the three-index axial assignment problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2004
%P 37-45
%N 12
%U http://geodesic.mathdoc.fr/item/IVM_2004_12_a3/
%G ru
%F IVM_2004_12_a3
V. M. Kravtsov. On new properties of the maximum noninteger vertices of the polytope in the three-index axial assignment problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2004), pp. 37-45. http://geodesic.mathdoc.fr/item/IVM_2004_12_a3/

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

[2] Pierskalla W. P., “The multidimensional assignment problem”, Oper.Res., 16 (1968), 422–431 | DOI | Zbl

[3] Poore A. B., “Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking”, Comput. Optimiz. and Applic., 3 (1994), 27–54 | DOI | MR

[4] Arbib C., Pacciarelli D., Smriglio S., “A three-dimensional matching model for perishable production scheduling”, Discrete Appl. Math., 92 (1999), 1–15 | DOI | MR | Zbl

[5] Euler R., “Odd cycles and a class of facets of the axial 3-index assignment polytope”, Zastosowania Matematyki, 19:3–4 (1987), 375–386 | MR | Zbl

[6] Gwan G., Qi L., “On facets of the three-index assignment polytope”, Australasian J. Combinatorics, 6 (1992), 67–87 | MR | Zbl

[7] Qi L., Balas E., Gwan G., “A new facet class and a polyhedral method for the three-index assignment problem”, Advances in Optimization and Approximation, eds. D. Du, J. Sun, Kluwer Academic, 1994, 256–274 | MR | Zbl

[8] Kravtsov M. K., Lukshin E. V., “O netselochislennykh vershinakh mnogogrannika mnogoindeksnoi aksialnoi zadachi vybora”, Izv. vuzov. Matematika, 1999, no. 12, 65–70 | MR | Zbl

[9] Kravtsov M. K., Kravtsov V. M., Lukshin E. V., “O chisle $r$-netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi vybora”, Izv. vuzov. Matematika, 2000, no. 12, 89–92 | MR | Zbl

[10] Kravtsov M. K., Kravtsov V. M., Lukshin E. V., “O tipakh $(3n-2)$-netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi vybora”, Izv. vuzov. Matematika, 2002, no. 12, 84–90 | MR | Zbl

[11] Kravtsov M. K., Kravtsov V. M., Lukshin E. V., “O netselochislennykh vershinakh mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Diskretn. matem., 13:2 (2001), 120–143 | MR | Zbl

[12] Kravtsov M. K., Kravtsov V. M., Lukshin E. V., “O chisle netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Vestsi NAN Belarusi. Ser. fiz.-mat. navuk, 2000, no. 4, 59–65 | MR

[13] Kravtsov V. M., “Otsenki snizu chisla netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Vestnik BGU. Ser. 1, 2002, no. 3, 87–90 | MR

[14] Kravtsov V. M., “O novykh tipakh maksimalno netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Vestnik BGU. Ser. 1, 2003, no. 3, 80–85 | MR | Zbl

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

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

[17] Yudin D. B., Golshtein E. G., Lineinoe programmirovanie. Teoriya i konechnye metody, Fiziko-matematicheskaya literatura, M., 1963, 776 pp. | MR