Mixed-integer nonlinear programming with symmetry breaking computes epsilon-optimal solutions for Heilbronn's triangle problem up to n=9 in minutes and recovers exact coordinates matching prior best-known configurations.
A lower bound for Heilbronn’s problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
From Computational Certification to Exact Coordinates: Heilbronn's Triangle Problem on the Unit Square Using Mixed-Integer Optimization
Mixed-integer nonlinear programming with symmetry breaking computes epsilon-optimal solutions for Heilbronn's triangle problem up to n=9 in minutes and recovers exact coordinates matching prior best-known configurations.