883 search results - page 13 / 177 » A Genetic Algorithm Applied to the Maximum Flow Problem |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
SAC
2004
ACM
14 years 27 days ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
JGO
2010
13 years 6 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 ...