Sciweavers

883 search results - page 15 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
ICALP
2009
Springer
14 years 7 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 28 days ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
EMO
2006
Springer
173views Optimization» more  EMO 2006»
13 years 11 months ago
Differential Evolution versus Genetic Algorithms in Multiobjective Optimization
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
Tea Tusar, Bogdan Filipic
TOC
2008
104views more  TOC 2008»
13 years 7 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
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...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
FSTTCS
2007
Springer
14 years 1 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...