The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
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,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2005-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v13-n1/v13-n1-(pp29-36).pdf |