RO EN
Optimal multicommodity flows in dynamic networks and algorithms for their finding.
Authors: Fonoberova Maria, Lozovanu Dmitrii
– 0.16 Mb
Abstract
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function also depends on time. We propose algorithms for solving these dynamic problems, which are based on their reducing to static ones on a time-expanded network.E-mails: ; email('lozovanu@math.md') %]
Fulltext
– 0.16 Mb
Contents
- Automodel solution for dynamic problem of two-component media.
- On the structure of finite medial quasigroups.
- Optimal multicommodity flows in dynamic networks and algorithms for their finding.
- Some new exact solutions for the lineal flow of a non-Newtonian fluid.
- Absolute Asymptotic Stability of Discrete Linear Inclusions.
- On geometrical properties of the spaces defined by the Pfaff equations.
- A nonlinear hydrodynamic stability criterion derived by a generalized energy method.
