RO EN
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
Authors: Fonoberova Maria, Lozovanu Dmitrii
Mathematics Subject Classification 2000: 90B10, 90C35, 90C27.
– 0.15 Mb
Abstract
The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied. This dynamic problem is considered on directed networks with a set of commodities, time-varying capacities, fixed transit times on arcs, and a given time horizon. We assume that cost functions, defined on edges, are nonlinear and depend on time and flow and the demand function also depends on time. The corresponding algorithm, based on reducing the dynamic problem to a static problem on a time-expanded network, to solve the minimum cost dynamic multicommodity flow problem is proposed and some details concerning its complexity are discussed.Mathematics Subject Classification 2000: 90B10, 90C35, 90C27.
Fonoberova, D.D. Lozovanu
Institute of Mathematics and Computer Science,
5 Academiei str.
Chisinau, MD2028, Moldova.
E-mail :
E-mail :
Institute of Mathematics and Computer Science,
5 Academiei str.
Chisinau, MD2028, Moldova.
E-mail :
E-mail :
Fulltext
– 0.15 Mb
Contents
- An Automatic Proof of Euler's Formula
- A generalization of the chromatic polynomial of a cycle
- Nash equilibria sets in mixed extension of 2x2x2 games
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- On a k-clique-join of a class of partitionable graphs
- On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
- The solution of problem of objects classification as the method of restoration of objects images
- Generic Interfaces for Managing Web Data
- Variable Bit Permutations: Linear Characteristics and Pure VBP-Based Cipher
- Abstracts of Dr. Thesis
