36 search results - page 3 / 8 » Greedy Heuristics and an Evolutionary Algorithm for the Boun... |
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
EVOW
2005
Springer
13 years 10 months ago
2005
Springer
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...