Geodesic
The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 3, pp. 334-351 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1995_35_3_a1,
     author = {M. R. Davidson},
     title = {The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {334--351},
     year = {1995},
     volume = {35},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_3_a1/}
}
TY  - JOUR
AU  - M. R. Davidson
TI  - The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1995
SP  - 334
EP  - 351
VL  - 35
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_3_a1/
LA  - ru
ID  - ZVMMF_1995_35_3_a1
ER  - 
%0 Journal Article
%A M. R. Davidson
%T The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1995
%P 334-351
%V 35
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_3_a1/
%G ru
%F ZVMMF_1995_35_3_a1
M. R. Davidson. The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 3, pp. 334-351. http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_3_a1/

[1] Iri M., “On an extension of the maximum-flow, minimum-cut theorem to multicommodity flows in networks”, IEEE Trans. Circuit. Theory, 18:4 (1971), 129–135 | MR

[2] Matula D., “Concurrent flow and concurrent connectivity in graphs”, Graph Theory and Its Appl. to Algorithms and Comput. Sci., Acad. Press, N. Y., 1985 | MR

[3] Malashenko Yu. E., Stanevichyus A.-I. A., “O reshenii mnogoproduktovoi zadachi s tselochislennymi potokami”, Zh. vychisl. matem. i matem. fiz., 22:3 (1982), 732–735 | MR | Zbl

[4] Malashenko Yu. E., Novikova N. M., Mnogokriterialnyi i maksiminnyi analiz mnogoproduktovykh setei, VTs AN SSSR, M., 1988 | MR

[5] Malashenko Yu. E., Matematicheskie modeli analiza potokovykh setevykh sistem, VTs RAN, M., 1993 | MR

[6] Malashenko Yu. E., “Normativnyi podkhod k analizu mnogoproduktovykh setei”, Izv. AN SSSR. Tekhn. kibernetika, 1988, no. 3, 117–122 | MR

[7] Klepikova M. G., Problemy ustoichivosti zadach matematicheskogo programmirovaniya, Avtoref. dis. $\dots$ kand. fiz.-matem. nauk, MGU, M., 1986

[8] Nefedov V. N., “Leksikograficheskaya zadacha s poliedralnym mnozhestvom strategii”, Vestn. MGU. Vychisl. matem. i kibernetika, 1981, no. 1, 77–81 | MR

[9] Davidson M. R., “Ob uslovnoi ustoichivosti krainikh tochek mnogogrannogo mnozhestva”, Zh. vychisl. matem. i matem. fiz., 34:1 (1994), 29–43 | MR | Zbl

[10] Ashmanov S. A., Lineinoe programmirovanie, Nauka, M., 1981 | Zbl

[11] Ashmanov S. A., “Uslovnaya ustoichivost zadach lineinogo programmirovaniya”, Programmnoe oborudovanie i vopr. prinyatiya reshenii, Izd-vo MGU, M., 1989, 99–105

[12] E. G. Belousov, B. Bank (red.), Matematicheskaya optimizatsiya: voprosy razreshimosti i ustoichivosti, Izd-vs MGU, M., 1986

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