arXiv (All)
open access
From Global Optimization to Exact Coordinates: Heilbronn's Triangle Problem on the Unit Square Using Mixed-Integer Nonlinear Optimization
We develop a mixed-integer nonlinear programming (MINLP) approach for the Heilbronn triangle problem on the unit square. The formulation exploits the boundary structure of optimal configurations, which we establish rigorously, to fix coordinates and orientation variables a priori. With this formulat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An A-B-C Coordinate Encoding for Exact Boundary-Cycle Extraction on Hexagonal Lattices#1400279
- Shape optimization under minimal width and constant width constraints#1467706
- A Study on Microstructures of Homogenization for Topology Optimization#1026207
- Wall Drawing #63: A wall is divided into four horizontal parts. In the top row are four equal vertical divisions, each with lines in a different direction. In the second row, six double combinations; in the third row, four triple combinations; in the bottom row, all four combinations superimposed#498552
- An Adaptive Cubic Regularisation Algorithm Based on Interior-Point Methods for Optimization with General Inequality Constraints#1357328
Record · ID 1468186
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive