4131 search results - page 142 / 827 » The Generalized Max-Controlled Set Problem |
150
Voted
DIS
2000
Springer
15 years 7 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
137
click to vote
SODA
2010
ACM
16 years 24 days ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
131
click to vote
AI
1998
Springer
15 years 3 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
132
click to vote
MSOM
2008
15 years 2 months ago
2008
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
140
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...