3320 search results - page 288 / 664 » Heuristics for the Phylogeny Problem |
176
click to vote
EVOW
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
161
click to vote
WEA
2004
Springer
16 years 4 days ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
201
click to vote
AE
2003
Springer
16 years 23 hour ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
170
click to vote
ESA
2003
Springer
16 years 12 hour ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
166
click to vote
EVOW
2010
Springer
15 years 12 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...