4843 search results - page 149 / 969 » The Shortcut Problem - Complexity and Approximation |
121
click to vote
WSC
2008
15 years 5 months ago
2008
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...
132
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
110
Voted
IJCGA
2002
15 years 2 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
143
click to vote
SIAMJO
2011
14 years 9 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...
193
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...