287 search results - page 9 / 58 » A Tree Search Algorithm for Solving the Container Loading Pr... |
TCBB
2008
13 years 7 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
ICCAD
1998
IEEE
13 years 11 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
AI
2006
Springer
13 years 7 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...