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

DOI10.1007/S10898-016-0453-1MaRDI QIDQ2397437zbMATHOpenAlexFDO

Authors Liangyu Chen, Yaochen Xu, Zhenbing Zeng

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)

Recommendations

• Fine-grain parallel RRB-solver for 5-/9-point stencil problems suitable for GPU-type processors
• Efficient GPU-based implementations of simplex type algorithms

Cites work

• scientific article; zbMATH DE number 169536 (Why is no real title available?)
• scientific article; zbMATH DE number 713445 (Why is no real title available?)
• scientific article; zbMATH DE number 895366 (Why is no real title available?)
• scientific article; zbMATH DE number 7662692 (Why is no real title available?)
• A Lower Bound for Heilbronn'S Problem
• An upper bound of Heilbronn number for eight points in triangles
• Finding largest small polygons with gloptipoly
• Maximizing the Smallest Triangle Made by N Points in a Square
• New lower bounds for Heilbronn numbers
• On Heilbronn's Triangle Problem
• On a Problem of Heilbronn
• On the Heilbronn Optimal Configuration of Seven Points in the Square
• Optimal packing of 28 equal circles in a unit square -- the first reliable solution
• Research Problems in Discrete Geometry
• The largest small octagon
• The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
• The small octagon with longest perimeter

Cited in

(1)

• Heilbronn's problem of eight points in the square

Describes a project that uses

Uses Software

• GloptiPoly

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)