3320 search results - page 123 / 664 » Heuristics for the Phylogeny Problem |
179
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
144
click to vote
GECCO
2009
Springer
16 years 25 days ago
2009
Springer
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
164
click to vote
EVOW
2007
Springer
16 years 13 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
150
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
177
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...