883 search results - page 8 / 177 » A Genetic Algorithm Applied to the Maximum Flow Problem |
IPCO
1998
13 years 8 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
LREC
2010
13 years 9 months ago
2010
In this paper, we propose classifier ensemble selection for Named Entity Recognition (NER) as a single objective optimization problem. Thereafter, we develop a method based on gen...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...