108 search results - page 1 / 22 » Two-Level Push-Relabel Algorithm for the Maximum Flow Proble... |
77
Voted
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
101
Voted
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...
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...
ESA
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE