Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems
Graph colouring is a combinatorial optimisation problem consisting in colouring the vertices of a graph such that no vertices connected by an edge receive the same colour. The minimal number of colours for which such a colouring exists is an intrinsic property of the graph and is called chromatic nu...
Similar Items
-
A Hybrid Method for the Modelling and Optimisation of Constrained Search Problems
by: Sitek Pawel, et al.
Published: (2014-08-01) -
Effective integrations of constraint programming, integer programming and local search for two combinatorial optimisation problems
by: He, Fang
Published: (2012) -
Efficient local search for several combinatorial optimization problems
by: Buljubasic, Mirsad
Published: (2015) -
Multi-agent based cooperative search in combinatorial optimisation
by: Martin, Simon
Published: (2013) -
Ant Colony Optimization and Local Search for the Probabilistic Traveling Salesman Problem: A Case Study in Stochastic Combinatorial Optimization
by: Bianchi, Leonora
Published: (2006)