Geodesic
Polynomial solvability of special problems of disjunctive programming
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 2, pp. 341-345 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1999_39_2_a20,
     author = {A. B. Zinchenko},
     title = {Polynomial solvability of special problems of disjunctive programming},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {341--345},
     year = {1999},
     volume = {39},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a20/}
}
TY  - JOUR
AU  - A. B. Zinchenko
TI  - Polynomial solvability of special problems of disjunctive programming
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 341
EP  - 345
VL  - 39
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a20/
LA  - ru
ID  - ZVMMF_1999_39_2_a20
ER  - 
%0 Journal Article
%A A. B. Zinchenko
%T Polynomial solvability of special problems of disjunctive programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 341-345
%V 39
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a20/
%G ru
%F ZVMMF_1999_39_2_a20
A. B. Zinchenko. Polynomial solvability of special problems of disjunctive programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 2, pp. 341-345. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a20/

[1] Stoyan Yu. G., Yakovlev S. V., Matematicheskie modeli i optimizatsionnye metody geometricheskogo proektirovaniya, Nauk. dumka, Kiev, 1986 | MR

[2] Pshenichnyi B. N., Sobolenko L. A., “Metod obratno-vypuklogo programmirovaniya i ukladka parallelepipedov”, Kibernetika i sistemnyi analiz, 1996, no. 3, 16–26 | MR

[3] Stoyan Yu. G., Sokolovskii V. Z., Reshenie nekotorykh mnogoekstremalnykh zadach metodom suzhayuschikhsya okrestnostei, Nauk. dumka, Kiev, 1980 | MR

[4] Zinchenko A. B., “Svoistva i usloviya razreshimosti chastnoi zadachi optimalnogo geometricheskogo razmescheniya”, Izv. SKNTs VSh. Estestv. nauki, 1984, no. 3, 17–20 | MR | Zbl

[5] Zinchenko A. B., “Setevoi podkhod k zadache razmescheniya s pryamougolnymi rasstoyaniyami”, Metody optimizatsii v ekonomiko-matematicheskom modelirovanii, TsEMI, M., 1988, 120–128

[6] Stoyan Yu. G., Magas S. L., “Ob odnom sposobe optimalnogo razmescheniya pryamougolnikov v polose”, Metody optimizatsii v ekonomiko-matematicheskom modelirovanii, TsEMI, M., 1988, 5–27

[7] Zhak S. V., Zinchenko A. B., “Opisanie mnogogrannikov dopustimykh reshenii nekotorykh zadach matematicheskogo programmirovaniya”, Izv. vuzov. Sev.-Kavk. region. Estestv. nauki, 1995, no. 4, 3–7 | Zbl

[8] Kovalev M. M., Matroidy v diskretnoi optimizatsii, Universitetskoe, Minsk, 1987 | MR

[9] Svami M., Tkhulasiraman K., Grafy, seti i algoritmy, Mir, M., 1984

[10] Sokolovskii V. Z., Kukharenok M. A., “Metod suzhayuschikhsya okrestnostei: realizatsii, testirovanie, prilozheniya”, Ekonomika i matem. metody, 21:6 (1985), 1092–1101 | MR