400 search results - page 6 / 80 » Extended formulations in combinatorial optimization |
149
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
149
Voted
ALMOB
2006
15 years 3 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
127
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
133
Voted
FUIN
2010
15 years 2 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
135
Voted
CCE
2008
15 years 3 months ago
2008
A central problem in bioinformatics and systems biology is the selection of appropriate models in a rational and systematic way. This fundamentally combinatorial problem can be re...