Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing

DOI10.1007/s10898-016-0453-1zbMath1372.90083OpenAlexW2466466883MaRDI QIDQ2397437

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

zbMATH Keywords

combinatorial geometrybranch-and-bound methodHeilbronn problemGPGPU technologyrectangle partition

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound of Heilbronn number for eight points in triangles
• The small octagon with longest perimeter
• The largest small octagon
• The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
• Optimal packing of 28 equal circles in a unit square -- the first reliable solution
• Finding largest small polygons with gloptipoly
• On the Heilbronn Optimal Configuration of Seven Points in the Square
• Research Problems in Discrete Geometry
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• Maximizing the Smallest Triangle Made by N Points in a Square
• On a Problem of Heilbronn
• New lower bounds for Heilbronn numbers

This page was built for publication: Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing