V. Ch. Kudaev, M. B. Abazokov, “Rank optimization for flow networks”, Vestnik KRAUNC. Fiz.-Mat. Nauki, 2018, Number 4(24),Pages <nobr>178–185</nobr>

RUS ENG

JOURNALS // Vestnik KRAUNC. Fiziko-Matematicheskie Nauki // Archive

Vestnik KRAUNC. Fiz.-Mat. Nauki, 2018 Number 4(24), Pages 178–185 (Mi vkam320)

This article is cited in 5 papers

INFORMATION AND COMPUTATION TECHNOLOGIES

Rank optimization for flow networks

V. Ch. Kudaev^a, M. B. Abazokov^b

^a Institute of Informatics and Problems of Regional Management of Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences, ul. Inessa Armand, 37 “a”, 360051 Nalchik, Russia
^b Institute of Applied Mathematics and Automation of Kabardino-Balkarian Scientific Center of the Russian Academy of Sciences, ul. Shortanova, 89 “а”, 360000, Nalchik, Russia.

Abstract: 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.

UDC: 519.85; 519.17

MSC: 05C85, 05C21, 90C25, 90C39

Received: 18.09.2018

DOI: 10.18454/2079-6641-2018-24-4-178-185

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025