Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding.
Authors: Fonoberova Maria, Lozovanu Dmitrii
– 0.15 Mb
Abstract
We consider the minimum cost multicommodity flow problem in dynamic networks with time-varying capacities of arcs and transit times on arcs that depend on the sort of commodity entering them. We assume that cost functions, defined on arcs, are nonlinear and depend on time and flow, and the demand function also depends on time. Moreover, we study the problem in the case when transit time functions depend on time and flow. The modification of the time-expanded network method and new algorithms for solving the considered classes of problems are proposed.E-mail: ,
Fulltext
– 0.15 Mb
Contents
- Pareto approximation of the tail by local exponential modeling.
- Classification of GL(2, ℜ)-orbit's dimensions for the differential equations' system with homogeneities of the 4th order.
- Power sets of n-ary quasigroups.
- Existence and uniqueness results for a class of nonlinear differential problems.
- Biharmonic curves in Cartan-Vranceanu (2n+1)-dimensional spaces.
- Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic.
- Linear convolution of criteria in the vector p-center problem.
- On LCA groups in which some closed subgroups have commutative rings of continuous endomorphisms.
- Multi-dimensional Darboux type differential systems with quadratic nonlinearities.
- GL(2, ℜ) -orbits in a competing species model.
- Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding.
