16404 search results - page 777 / 3281 » A set coverage problem |
199
click to vote
IPL
2008
15 years 7 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
160
click to vote
ORL
2008
15 years 7 months ago
2008
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also sh...
200
click to vote
DAM
2000
15 years 7 months ago
2000
Abstract. The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly...
169
click to vote
SIAMCOMP
2000
15 years 7 months ago
2000
We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in R3 such that the aspect...
160
Voted
NGC
2002
Springer
15 years 7 months ago
2002
Springer
Sequence design is a crucial problem in information-based biotechnology such as DNA-based computation. We introduce a simple strategy named template method that systematically gene...