1277 search results - page 89 / 256 » Terminating Decision Algorithms Optimally |
155
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
114
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
129
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on age...
145
click to vote
GPEM
2002
15 years 3 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
130
click to vote
TEC
2002
15 years 2 months ago
2002
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...