Sciweavers

86 search results - page 1 / 18
» Flows in dynamic networks with aggregate arc capacities
Sort
View
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
13 years 8 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella
IPL
2007
107views more  IPL 2007»
13 years 11 months ago
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Vardges Melkonian
NETWORKS
2006
13 years 11 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
MP
1998
136views more  MP 1998»
13 years 10 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...