13376 search results - page 433 / 2676 » Problem Solving with |
142
click to vote
WSC
2008
15 years 7 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
117
Voted
MANSCI
2008
15 years 4 months ago
2008
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
148
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
116
click to vote
EOR
2006
15 years 4 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
129
Voted
TIT
2008
15 years 4 months ago
2008
Abstract. We discuss some applications of the pairing inversion problem and outline some potential approaches for solving it. Our analysis of these approaches gives further evidenc...