Sciweavers

16404 search results - page 440 / 3281
» A set coverage problem
Sort
View
TCBB
2008
101views more  TCBB 2008»
15 years 6 months ago
The Undirected Incomplete Perfect Phylogeny Problem
The incomplete perfect phylogeny (IPP) problem and the incomplete perfect phylogeny haplotyping (IPPH) problem deal with constructing a phylogeny for a given set of haplotypes or g...
Ravi Vijaya Satya, Amar Mukherjee
IJKESDP
2010
60views more  IJKESDP 2010»
15 years 5 months ago
Portfolio selection problems with normal mixture distributions including fuzziness
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
Takashi Hasuike, Hiroaki Ishii
EVOW
2007
Springer
16 years 28 days ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
WABI
2005
Springer
108views Bioinformatics» more  WABI 2005»
16 years 7 days ago
On the Complexity of Several Haplotyping Problems
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
ENDM
2006
77views more  ENDM 2006»
15 years 6 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...