Heilbronn's Problem of Eight Points in the Square

摘要

In this work the authors consider the problem of optimally distributing 8 points inside a unit square so that the smallest area of the ((8)(3)) triangles formed by them is maximal. Symbolic computations are employed to reduce the problem into a nonlinear programming problem and find its optimal solution. All computations are done using Maple.

关键词