Bidirectional resource networks: A new flow model

DOI10.1134/S1064562410040368MaRDI QIDQ600769zbMATH OpenFDO

Authors L. Yu. Zhilyakova, O. P. Kuznetsov

Publication date 1 November 2010

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064562410040368

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21) Discrete-time Markov processes on general state spaces (60J05) Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Review text

The classical model of flows in networks [\textit{L. R. Ford} and \textit{D. R. Fulkerson}, Flows in networks. Moskau: Verlag `Mir' (1966; Zbl 0139.13701); \textit{R. K. Ahuja, T. L. Magnanti} and \textit{J. B. Orlin}, Network flows. Theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall (1993; Zbl 1201.90001)] and its dynamic modifications (see, e.g., [\textit{L. Fleischer} and \textit{M. Skutella}, in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms (SODA 2003), Baltimore, MD, USA. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 66--75 (2003; Zbl 1094.90511)]) are characterized by two properties: (a) the network is open: it includes sources from which resources flow into the network and sinks that consume resources; and (b) the intermediate vertices serve as a transfer medium between the sources and the sinks. In static problems, the delay of resources at intermediate vertices is prohibited [Ford and Fulkerson (loc. cit.)], while, in dynamic problems, it is generally undesirable [Fleischer and Skutella (loc. cit.)]. In this paper, we consider a dynamic model of a closed system in which no resources are supplied or consumed. Resources are contained at vertices and can be exchanged between them. The basic problem is to analyze the exchange processes and their stabilization.

Recommendations

• Equilibrium resource distribution in a network model
• Dynamic resource networks. The case of small resource
• Asymmetric resource networks. II. Flows for large resources and their stabilization
• Flows in strongly regular periodic dynamic resource networks
• Asymmetrical resource networks. I. Stabilization processes for low resources

Cites work

• Finite Continuous Time Markov Chains
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3296351 (Why is no real title available?)
• scientific article; zbMATH DE number 3319130 (Why is no real title available?)

Cited in

(12)

• Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
• Dynamic graph models and their properties
• Equilibrium resource distribution in a network model
• The maximum flow problem in a network with special conditions of flow distribution
• Fixation for distributed clustering processes
• Control of limit states in absorbing resource networks
• Dynamic resource networks. The case of small resource
• Flows in strongly regular periodic dynamic resource networks
• Using resource networks to model substance distribution in aqueous medium
• Using resource networks to model substance distribution in aqueous medium
• On the realizability of stationary flows in resource networks by flows in classical networks
• Local in-flows control in regular resource networks with a low resource

This page was built for publication: Bidirectional resource networks: A new flow model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600769)