Geodesic
Types of maximally noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 3 (2012), pp. 9-16.

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

We describe various types of maximally noninteger vertices.We identify types of polyhedron vertices by the number of fractional components contained in three-sections of four-index matrices representing the polyhedron vertices.
Keywords: relaxation polyhedron of four-index axial assignment problem, maximally noninteger vertex, three-section of four-index matrix
Mots-clés : vertex type. 
@article{IVM_2012_3_a1,
     author = {M. K. Kravtsov and V. M. Kravtsov},
     title = {Types of maximally noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {9--16},
     publisher = {mathdoc},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2012_3_a1/}
}
TY  - JOUR
AU  - M. K. Kravtsov
AU  - V. M. Kravtsov
TI  - Types of maximally noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2012
SP  - 9
EP  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2012_3_a1/
LA  - ru
ID  - IVM_2012_3_a1
ER  - 
%0 Journal Article
%A M. K. Kravtsov
%A V. M. Kravtsov
%T Types of maximally noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2012
%P 9-16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2012_3_a1/
%G ru
%F IVM_2012_3_a1
M. K. Kravtsov; V. M. Kravtsov. Types of maximally noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 3 (2012), pp. 9-16. http://geodesic.mathdoc.fr/item/IVM_2012_3_a1/

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

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

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

[4] Kravtsov V. M., “O kharakterizatsii netselochislennykh vershin relaksatsionnogo mnogogrannika mnogoindeksnoi aksialnoi zadachi o naznacheniyakh”, Zhurn. vychisl. matem. i matem. fiz., 50:9 (2010), 1697–1708 | MR | Zbl

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

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

[7] 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

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

[9] Kravtsov V. M., “O maksimalno netselochislennykh vershinakh mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Avtomatika i telemekhanika, 2004, no. 3, 62–70 | MR | Zbl

[10] Kravtsov V. M., “O kharakterizatsii tipov maksimalno netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Zhurn. vychisl. matem. i matem. fiz., 46:10 (2006), 1908–1912 | MR

[11] Kravtsov V. M., “Kharakterizatsiya tipov maksimalno netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Izv. vuzov. Matem., 2006, no. 12, 65–68 | MR

[12] Kravtsov V. M., “Kombinatornye svoistva netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Kibernet. i sistem. anal., 2007, no. 1, 33–44 | MR | Zbl

[13] Kravtsov V. M., “Kharakterizatsiya tipov polnostyu netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Vestn. Belorussk. un-ta. Ser. 1, 2007, no. 1, 108–113 | MR

[14] Kravtsov M. K., Lukshin E. V., “O netselochislennykh vershinakh mnogogrannika trekhindeksnoi aksialnoi transportnoi zadachi”, Avtomatika i telemekhanika, 2004, no. 3, 71–79 | MR | Zbl

[15] Kravtsov M. K., Lukshin E. V., “Polyhedral combinatorics of multi-index axial transportation problems”, European J. Oper. Res., 189:3 (2008), 920–938 | DOI | MR | Zbl

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