Geodesic
A characterization of the types of maximal noninteger vertices of a polyhedron in the three-index axial assignment problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2006), pp. 65-68.

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

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

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

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

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

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

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

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

[7] Kravtsov V. M., “O novykh svoistvakh maksimalno netselochislennykh vershin mnogogrannika trekhindeksnoi aksialnoi zadachi o naznacheniyakh”, Izv. vuzov. Matematika, 2004, no. 12, 37–45 | MR

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

[9] Kholl M., Kombinatorika, Nauka, M., 1970, 424 pp. | MR

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