Name
Abstract | ||
|---|---|---|
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 points have area at least H-n. In this note we establish new bounds for the first Heilbronn numbers. These new values have been found by using a simple implementation of simulated annealing to obtain a first approximation and then optimizing the results by finding the nearest exact local maximum. |
Year | Venue | Keywords |
|---|---|---|
2002 | ELECTRONIC JOURNAL OF COMBINATORICS | lower bound,simulated annealing |
Field | DocType | Volume |
Simulated annealing,Discrete mathematics,Combinatorics,Unit square,Mathematics | Journal | 9 |
Issue | ISSN | Citations |
1 | 1077-8926 | 1 |
PageRank | References | Authors |
0.42 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesc Comellas | 1 | 155 | 25.07 |
| J. Luis A. Yebra | 2 | 24 | 4.95 |