2031 search results - page 37 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
ICANN
2001
Springer
14 years 13 days ago
2001
Springer
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
SIAMJO
2008
13 years 7 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
SIAMIS
2010
13 years 2 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
ANTSW
2004
Springer
14 years 1 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
CP
2004
Springer
14 years 1 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...