28 search results - page 3 / 6 » Combinatorial Problems Arising in SNP and Haplotype Analysis |
EXPCS
2007
13 years 11 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
EVOW
2004
Springer
14 years 25 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 ...
IOR
2011
13 years 2 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
SIAMJO
2011
13 years 1 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...