Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-28T14:16:26.536Z Has data issue: false hasContentIssue false
  • English
  • Français

Simulated Annealing and Graph Colouring

Published online by Cambridge University Press:  12 April 2001

ANDREAS NOLTE  and
RAINER SCHRADER
ANDREAS NOLTE
Affiliation:
Universität zu Köln, Weyertal 80, 50931 Köln, Germany (e-mail: [email protected], [email protected])
RAINER SCHRADER
Affiliation:
Universität zu Köln, Weyertal 80, 50931 Köln, Germany (e-mail: [email protected], [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Simulated annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of simulated annealing to the 3-colouring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected first hitting time of a proper colouring, given an arbitrary cooling scheme, is of exponential size.

These results are complementary to those in [13], where we prove the convergence of simulated annealing to an optimal solution in exponential time.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 1 , January 2001 , pp. 29 - 40
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Extended version of [14].