A simulated annealing algorithm for determining the thickness of a graph

We also give a new upper bound for the thickness of complete tripartite graphs, whose vertex sets are of equal size.