RO EN
The minimum-cost flow problem on dynamic networks and an algorithm for its solving.
Authors: Lozovanu Dmitrii, Stratila D.
Abstract
We study the minimum-cost flow problem on acyclic dynamic networks with non-linear cost functions depending on time and edge flow. We present an algorithm for solving the problem on networks with unit transit time, and study its generalizations. We also discuss details concerning the correctness of the algorithm, and its computational complexity.E-mail:
Contents
- Lagrange and Hamilton spaces. Geometrical models in Mechanics.
- Intuitionistic fuzzy approach to BCC-algebras.
- On the Complexity of Some Discrete Time Systems.
- On the optimization of nonsmooth Kirchhoff-Love arches.
- Decompozitionnof some algebras with topologies and their Resolvability.
- The minimum-cost flow problem on dynamic networks and an algorithm for its solving.
- Symplectic connections in Lagrange geometry.
- On weighted functional spaces.
- Again on the direct sums of modules with the direct summand intersection property.
- A note on almost Hermitian manifolds with a J -invariant Ricci tensor.
- Generalized notion of differentiability.
- Convergence of collocation and quadratures methods for solving systems of nonlinear singular integral equations given on closed smooth contour.
- Fuzzy subfields.
