654 search results - page 4 / 131 » Hybrid Modelling for Robust Solving |
AIPS
2006
13 years 9 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...