An upper bound of Heilbronn number for eight points in triangles

DOI10.1007/S10878-012-9585-5zbMATH Open1331.90063OpenAlexW2122752151MaRDI QIDQ489736FDOQ489736

Authors: Liangyu Chen, Zhenbing Zeng, Wei Zhou 

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

combinatorial optimizationparallel computationupper boundHeilbronn number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• How Does One Cut a Triangle?
• Points in a triangle forcing small triangles
• Title not available (Why is that?)

Cited In (2)

• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
• Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489736)