290 search results - page 1 / 58 » Balancing Applied to Maximum Network Flow Problems |
81
Voted
ESA
2006
Springer
15 years 2 months ago
2006
Springer
102
click to vote
ICGA
1993
14 years 11 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
WEA
2007
Springer
15 years 4 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
NETWORKS
2006
14 years 10 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
TOC
2008
14 years 10 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...