4894 search results - page 143 / 979 » The Guarding Problem - Complexity and Approximation |
138
click to vote
UAI
2001
15 years 7 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
162
click to vote
IPCO
1998
15 years 7 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
193
click to vote
ANOR
2007
15 years 6 months ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
195
click to vote
SIAMSC
2010
15 years 4 months ago
2010
In this article we consider the a posteriori error estimation and adaptive mesh refinement of discontinuous Galerkin finite element approximations of the hydrodynamic stability p...
189
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...