94 search results - page 2 / 19 » Capacity inverse minimum cost flow problem |
INFORMS
2008
13 years 5 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
AMC
2006
13 years 5 months ago
2006
NETWORKS
2007
13 years 4 months ago
2007
JGO
2010
13 years 3 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
COCOON
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...