Geodesic
The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 6, pp. 855-869 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1994_34_6_a5,
     author = {O. A. Emets},
     title = {The optimization of linear and convex functions on an {Euclidean} combinatorial set of polypermutations},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {855--869},
     year = {1994},
     volume = {34},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_6_a5/}
}
TY  - JOUR
AU  - O. A. Emets
TI  - The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1994
SP  - 855
EP  - 869
VL  - 34
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_6_a5/
LA  - ru
ID  - ZVMMF_1994_34_6_a5
ER  - 
%0 Journal Article
%A O. A. Emets
%T The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1994
%P 855-869
%V 34
%N 6
%U http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_6_a5/
%G ru
%F ZVMMF_1994_34_6_a5
O. A. Emets. The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 6, pp. 855-869. http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_6_a5/

[1] Sergienko I. V., “Odin metod resheniya zadach na otyskanie ekstremalnykh znachenii”, Avtomatika, 1964, no. 5, 15–21 | MR

[2] Zalesskii A. E., “Svedenie nekotorykh kombinatornykh zadach k tselochislennomu lineinomu programmirovaniyu”, Vestsi Akad. navuk BSSR. Ser. Fiz.-matem. navuk, 1965, no. 3, 24–28 | MR

[3] Suprunenko D. A., “O znacheniyakh lineinoi formy na mnozhestve podstanovok”, Kibernetika, 1968, no. 2, 59–63 | MR | Zbl

[4] Stoyan Yu. G., Nekotorye svoistva spetsialnykh kombinatornykh mnozhestv, Preprint No 85, In-t probl. mashinostr. AN USSR, Kharkov, 1980, 22 pp.

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

[6] Emets O. A., Evklidovy kombinatornye mnozhestva i optimizatsiya na nikh. Novoe v matematicheskom programmirovanii, UMK VO, Kiev, 1992

[7] Demyanov V. F., Vasilev L. V., Nedifferentsiruemaya optimizatsiya, Nauka, M., 1981 | MR

[8] Khardi G. G., Litlvud Dzh., Polna G., Neravenstva, Izd-vo inostr. lit., M., 1948

[9] Emets O. A., Svoistva spetsialnykh kombinatornykh zadach optimizatsii, metody i algoritmy ikh resheniya, Dis. $\dots$ kand. fiz.-matem. nauk, Kharkovsk. in-t radioelektroniki, Kharkov, 1984, 120 pp.

[10] Stoyan Yu. G., Yakovlev S. V., “Svoistva vypuklykh funktsii na perestanovochnom mnogogrannike”, Dokl. AN USSR. Ser. A, 1988, no. 5, 68–70 | MR | Zbl

[11] Emets O. A., Ob obschem poliperestanovochnom mnogogrannike i nekotorykh ego svoistvakh, Dep. v UkrNIINTI 31.10.89, No 2362-Uk89, Polt. inzh.-stroit. in-t, Poltava, 1989

[12] Emets O. A., “Zadachi optimizatsii na evklidovom poliperestanovochnom mnozhestve s povtoreniyami: svoistva dopustimogo mnozhestva”, Metody n programmnye sredstva optimizatsii, modelir. i sozdaniya vychisl. sistem, In-t kibernetiki AN USSR, Kiev, 1990, 22–24

[13] Sukharev A. G., Timokhov A. V., Fedorov V. V., Kurs metodov optimizatsii, Nauka, M., 1986 | MR | Zbl

[14] Yudin D. B., Golshtein E. G., Zadachi i metody nelineinogo programmirovaniya, Nauka, M., 1964

[15] Papadimitriu X., Staiglits K., Kombinatornaya optimizatsiya. Algoritmy i slozhnost, Mir, M., 1985 | MR

[16] Stoyan Yu. G., Emets O. A., “O kombinatornykh zadachakh razmescheniya pryamougolnikov”, Ekonomika i matem. metoda, 21:5 (1985), 869–881 | MR

[17] Emets O. A., “Kombinatornaya model i priblizhennyi metod s apriornoi otsenkoi resheniya optimizatsionnoi zadachi razmescheniya raznotsvetnykh pryamougolnikov”, Ekonomika i matem. metody, 29:2 (1993), 294–304

[18] Sovremennoe sostoyanie teorii issledovaniya operatsii, Nauka, M., 1979 | MR

[19] Zhuravlev Yu. I., “Lokalnye algoritmy vychisleniya informatsii. I”, Kibernetika, 1965, no. 1, 12–19 ; II No 2, 1–11 | MR | Zbl

[20] Zhuravlev Yu. I., Finkelshtein Yu. Yu., “Lokalnye algoritmy dlya zadach lineinogo tselochislennogo programmirovaniya”, Probl. kibernetiki, 14, Nauka, M., 1965, 289–295

[21] Sergienko I. V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii, Nauk. dumka, Kiev, 1985 | MR

[22] Sergienko I. V., Kaspshitskaya M. F., Modeli i metody resheniya na EVM kombinatornykh zadach optimizatsii, Nauk. dumka, Kiev, 1981 | MR