Rank optimization for flow networks
Vestnik KRAUNC. Fiziko-matematičeskie nauki, no. 4 (2018), pp. 178-185
Cet article a éte moissonné depuis la source Math-Net.Ru
In this paper we present an algorithm for constructing an optimal P-rank flow network in a specified redundant geometric graph with potential links of nodes.
Keywords:
network problem, multiextremality, extremum rank, algorithm.
@article{VKAM_2018_4_a17,
author = {V. Ch. Kudaev and M. B. Abazokov},
title = {Rank optimization for flow networks},
journal = {Vestnik KRAUNC. Fiziko-matemati\v{c}eskie nauki},
pages = {178--185},
year = {2018},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VKAM_2018_4_a17/}
}
V. Ch. Kudaev; M. B. Abazokov. Rank optimization for flow networks. Vestnik KRAUNC. Fiziko-matematičeskie nauki, no. 4 (2018), pp. 178-185. http://geodesic.mathdoc.fr/item/VKAM_2018_4_a17/
[1] Kudaev V. CH., “Rangi ehkstremumov i strukturnaya optimizaciya bol'shih setevyh sistem”, Izvestiya KBNC RAN, 2016, no. 4(72), 15–24 | MR
[2] Kudaev V. CH., “Dvuhehtapnaya optimizaciya setevyh sistem”, Izvestiya KBNC RAN, 2007, no. 4(20), 138–145
[3] Bulatov V. P., Kassinskaya L. I., “Nekotorye metody minimizacii vognutoj funkcii na vypuklom mnogogrannike”, Metody optimizacii i ih prilozheniya, SEHI SO AN SSSR, Irkutsk, 1987, 151–172
[4] Tuj H., “Vognutoe programmirovanie pri linejnyh ogranicheniyah”, Doklady AN SSSR, 159:1 (1964), 32–35 | Zbl
[5] Trubin V. A., Mihalevich V. S., SHor N. Z., Optimizacionnye zadachi proizvodstvenno – transportnogo planirovaniya, Nauka, M., 1986, 260 pp.