An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...