440 search results - page 46 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
IPPS
2000
IEEE
14 years 4 days ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
WSC
2008
13 years 10 months ago
2008
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
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...
ENDM
2008
13 years 7 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
JBI
2004
13 years 9 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...