An upper bound of Heilbronn number for eight points in triangles

DOI10.1007/S10878-012-9585-5zbMath1331.90063OpenAlexW2122752151MaRDI QIDQ489736

Wei Zhou, Liangyu Chen, Zhenbing Zeng

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9585-5

zbMATH Keywords

upper boundcombinatorial optimizationparallel computationHeilbronn number

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• How Does One Cut a Triangle?
• Points in a triangle forcing small triangles

This page was built for publication: An upper bound of Heilbronn number for eight points in triangles