Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (Q2397437)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing |
scientific article; zbMATH DE number 6722127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing |
scientific article; zbMATH DE number 6722127 |
Statements
Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (English)
0 references
22 May 2017
0 references
Heilbronn problem
0 references
rectangle partition
0 references
branch-and-bound method
0 references
combinatorial geometry
0 references
GPGPU technology
0 references
0 references
0.8118012
0 references
