Sciweavers

3320 search results - page 13 / 664
» Heuristics for the Phylogeny Problem
Sort
View
CP
2005
Springer
14 years 2 months ago
Solving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
Mihaela Butaru, Zineb Habbas
EOR
2002
67views more  EOR 2002»
13 years 8 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi
IWANN
2009
Springer
14 years 3 months ago
ZARAMIT: A System for the Evolutionary Study of Human Mitochondrial DNA
Abstract. ZARAMIT is an information system capable of fully automated phylogeny reconstruction. Methods have been tailored to mitochondrial DNA sequences, with focus on subproblem ...
Roberto Blanco, Elvira Mayordomo
ISAAC
2003
Springer
70views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Settling the Intractability of Multiple Alignment
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
Isaac Elias
LION
2010
Springer
307views Optimization» more  LION 2010»
14 years 1 months ago
A Column Generation Heuristic for the General Vehicle Routing Problem
This paper presents a column generation heuristic for the general vehicle routing problem (GVRP), a combined load acceptance and rich vehicle routing problem incorporating various ...
Asvin Goel