Sciweavers

108 search results - page 1 / 22
» Two-Level Push-Relabel Algorithm for the Maximum Flow Proble...
Sort
View
AAIM
2009
Springer
132views Algorithms» more  AAIM 2009»
14 years 2 months ago
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
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...
Andrew V. Goldberg
ICGA
1993
296views Optimization» more  ICGA 1993»
13 years 8 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
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...
Toshinori Munakata, David J. Hashier
NETWORKS
2006
13 years 7 months ago
The multiroute maximum flow problem revisited
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...
Donglei Du, R. Chandrasekaran
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
13 years 9 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
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...
Andrew V. Goldberg