|
Flows in networks with barrier reachability
I. M. Erusalimskyi, V. A. Skorokhodov, V. A. Rusakov Southern Federal University, Rostov-on-Don
Abstract:
The problem of flows in networks with barrier-type reachability restrictions is considered. We introduce new definitions that allow one to describe a flow in a network with reachability constraints, in particular, a representation of a flow as a vector-valued function. Conditions for preserving the flow and restricting the maximum flow along an arc are formulated in terms of vector-valued functions. This allows one to consider flow problems without passing to an unfolding, which is a graph with connected arcs.
Keywords:
graph theory, nonstandard reachability, barrier reachability, network, flow in network, breakthrough algorithm.
Citation:
I. M. Erusalimskyi, V. A. Skorokhodov, V. A. Rusakov, “Flows in networks with barrier reachability”, Proceedings of the Voronezh International Spring Mathematical School "Modern Methods of the Theory of Boundary-Value Problems. Pontryagin Readings – XXXII”, Voronezh, May 3–9, 2021, Part 1, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 208, VINITI, Moscow, 2022, 24–28
Linking options:
https://www.mathnet.ru/eng/into991 https://www.mathnet.ru/eng/into/v208/p24
|
Statistics & downloads: |
Abstract page: | 83 | Full-text PDF : | 35 | References: | 18 |
|