Discovering the conditions under which an optimization algorithm or search heuristic will
succeed or fail is critical for understanding the strengths and weaknesses of different …

This paper surveys the most important algorithmic and computational results on the Vertex
Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the …

Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We describe a general approach to optimization which we term``Squeaky
Wheel''Optimization (SWO). In SWO, a greedy algorithm is used to construct a solution which …

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring
techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose …

Descent methods for combinatorial optimization proceed by performing a sequence of local
changes on an initial solution which improve each time the value of an objective function …

We consider the multilevel paradigm and its potential to aid the solution of combinatorial
optimisation problems. The multilevel paradigm is a simple one, which involves recursive …

This paper presents the results of an experimental investigation on solving graph coloring
problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we …

The paper is in three parts. First, we use simple adversary arguments to redevelop and
explore some of the no-free-lunch (NFL) theorems and perhaps extend them a little. Second …