Geodesic
An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations
Diskretnaya Matematika, Tome 13 (2001) no. 1, pp. 110-118 
O. A. Emets; S. I. Nedobachii; L. N. Kolechkina. An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations. Diskretnaya Matematika, Tome 13 (2001) no. 1, pp. 110-118. http://geodesic.mathdoc.fr/item/DM_2001_13_1_a6/
@article{DM_2001_13_1_a6,
     author = {O. A. Emets and S. I. Nedobachii and L. N. Kolechkina},
     title = {An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations},
     journal = {Diskretnaya Matematika},
     pages = {110--118},
     year = {2001},
     volume = {13},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2001_13_1_a6/}
}
TY  - JOUR
AU  - O. A. Emets
AU  - S. I. Nedobachii
AU  - L. N. Kolechkina
TI  - An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations
JO  - Diskretnaya Matematika
PY  - 2001
SP  - 110
EP  - 118
VL  - 13
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DM_2001_13_1_a6/
LA  - ru
ID  - DM_2001_13_1_a6
ER  - 
%0 Journal Article
%A O. A. Emets
%A S. I. Nedobachii
%A L. N. Kolechkina
%T An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations
%J Diskretnaya Matematika
%D 2001
%P 110-118
%V 13
%N 1
%U http://geodesic.mathdoc.fr/item/DM_2001_13_1_a6/
%G ru
%F DM_2001_13_1_a6

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

We study a set of linear constraints determining the domain of admissible solutions of a problem with linear objective function to which the optimisation problem with linear–fractional objective function on permutations is reduced.

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

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

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

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

[5] Stoyan Yu. G., Emets O. A., Teoriya i metody evklidovoi kombinatornoi optimizatsii, In.-t sistem. issledovanii obrazovaniya, Kiev, 1993

[6] Stoyan Yu. G., Ob odnom otobrazhenii kombinatornykh mnozhestv v evklidovo prostranstvo, Preprint AN USSR, In-t problem mashinostroeniya, Kharkov, 1982

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

[8] Shor N. Z., Solomon D. I., Dekompozitsionnye metody v drobno-lineinom programmirovanii, Shtiintsa, Kishinev, 1989 | MR | Zbl

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

[10] Emets O. A., “Ob optimizatsii lineinykh i vypuklykh funktsii na evklidovom kombinatornom mnozhestve poliperestanovok”, Zhurn. vychisl. matematiki i matem. fiziki, 1994, no. 6, 855–869 | MR | Zbl

[11] Emets O. A., “Ob ekstremalnykh svoistvakh nedifferentsiruemykh vypuklykh funktsii na evklidovom mnozhestve sochetanii s povtoreniyami”, Ukr. matem. zhurn., 46:6 (1994), 680–691 | MR | Zbl

[12] Emets O. A., “Ob odnom metode otsecheniya dlya zadach kombinatornoi optimizatsii”, Ekonomika i matem. metody, 33:4 (1997), 120–129 | Zbl

[13] Emets O. A., Nedobachii S. I., “Obschii perestanovochnyi mnogogrannik: neprivodimaya sistema lineinykh ogranichenii i uravneniya vsekh gipergranei”, Nauchn. vest. Nats. tekhn. un-ta Ukrainy Kievskii politekhnicheskii institut, 1998, no. 1-2, 100–106

[14] Emets O. A., Kolechkina L. N., “Resheniya optimizatsionnykh zadach s drobno-lineinoi tselevoi funktsiei na obschem mnozhestve perestanovok”, Vestnik Gosuniv. Lvovskaya politekhnika. Prikladnaya matematika, 337 (1998), 317–320