1480 search results - page 127 / 296 » Ants can solve constraint satisfaction problems |
179
click to vote
KBS
2007
15 years 6 months ago
2007
Commitment management is a key issue in service-provisioning in the context of virtual organisations (VOs). A service-provider — which may be a single agent acting within an orga...
182
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
190
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
148
click to vote
SIAMJO
2008
15 years 6 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...
155
click to vote
ISAAC
1992
Springer
15 years 10 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...