The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...