10 search results - page 2 / 2 » Solving the Multidimensional Knapsack Problem Using an Evolu... |
120
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In recent years, the development of multi-objective evolutionary algorithms (MOEAs) hybridized with mathematical programming techniques has significantly increased. However, most...
135
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
154
click to vote
ACST
2006
15 years 4 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
134
click to vote
KES
2004
Springer
15 years 8 months ago
2004
Springer
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...
117
click to vote
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...