Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
DOI10.1007/S10898-016-0453-1zbMATH Open1372.90083OpenAlexW2466466883MaRDI QIDQ2397437FDOQ2397437
Zhenbing Zeng, Liangyu Chen, Yaochen Xu
Publication date: 22 May 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0453-1
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Cites Work
- Research Problems in Discrete Geometry
- The largest small octagon
- The small octagon with longest perimeter
- Finding largest small polygons with gloptipoly
- Optimal packing of 28 equal circles in a unit square -- the first reliable solution
- Title not available (Why is that?)
- An upper bound of Heilbronn number for eight points in triangles
- Title not available (Why is that?)
- On a Problem of Heilbronn
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- On Heilbronn's Triangle Problem
- A Lower Bound for Heilbronn'S Problem
- Maximizing the Smallest Triangle Made by N Points in a Square
- On the Heilbronn Optimal Configuration of Seven Points in the Square
- Title not available (Why is that?)
- Title not available (Why is that?)
- New lower bounds for Heilbronn numbers
Uses Software
This page was built for publication: Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397437)
