New lower bounds for Heilbronn numbers (Q5956602)

The \(n\)th Heilbronn number, \(H_n\), is the largest value such that \(n\) points can be placed in the unit square in such a way that all possible triangles defined by any three of the \(n\) points have an area of at least \(H\). In this paper the authors find new lower bounds for \(H_7\), \(H_8\), \(H_9\), \(H_{10}\) and \(H_{12}\). In order to derive these bounds a simulated annealing algorithm is used resulting in a good configuration of the points. This solution is then refined by using an analytical procedure to get the closest local maximum.