A beam search algorithm for the circular packing problem (Q960400)
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: A beam search algorithm for the circular packing problem |
scientific article; zbMATH DE number 5383135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A beam search algorithm for the circular packing problem |
scientific article; zbMATH DE number 5383135 |
Statements
A beam search algorithm for the circular packing problem (English)
0 references
17 December 2008
0 references
beam search
0 references
circular packing
0 references
dichotomous search
0 references
diversification
0 references
local-position distance
0 references
maximum hole degree
0 references
0 references
0 references
0.9392519593238832
0 references
0.921388864517212
0 references
0.8942402005195618
0 references
0.8659112453460693
0 references
0.8491993546485901
0 references
