Solving the Heilbronn triangle problem using global optimization methods

Suppose that we would like to place n>2 points in the unit square [0,1]x[0,1]. Notice that each triplet of points form a triangle. The Heilbronn triangle problem asks how these n points should be placed so that the area of the smallest triangle is maximized. In this project, our aim is to solve this problem using global optimization methods.
Junior and senior IE students with a strong background in operations research (at least one and preferably two courses) and computing will be considered only.