Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems

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...

Full description

Bibliographic Details
Main Author: Chiarandini, Marco
Format: Others
Language:English
en
Published: 2005
Online Access:https://tuprints.ulb.tu-darmstadt.de/595/1/ChiarandiniPhD.pdf
Chiarandini, Marco <http://tuprints.ulb.tu-darmstadt.de/view/person/Chiarandini=3AMarco=3A=3A.html> (2005): Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems.Darmstadt, Technische Universität, [Online-Edition: http://elib.tu-darmstadt.de/diss/000595 <http://elib.tu-darmstadt.de/diss/000595> <official_url>],[Ph.D. Thesis]

Internet

https://tuprints.ulb.tu-darmstadt.de/595/1/ChiarandiniPhD.pdf
Chiarandini, Marco <http://tuprints.ulb.tu-darmstadt.de/view/person/Chiarandini=3AMarco=3A=3A.html> (2005): Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems.Darmstadt, Technische Universität, [Online-Edition: http://elib.tu-darmstadt.de/diss/000595 <http://elib.tu-darmstadt.de/diss/000595> <official_url>],[Ph.D. Thesis]

Similar Items