451 search results - page 3 / 91 » Approximation algorithms for stochastic orienteering |
104
click to vote
IPCO
2004
14 years 10 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
EMO
2009
Springer
15 years 4 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
70
Voted
TOMACS
2010
14 years 4 months ago
2010
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...