A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396)
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 hybrid beam search looking-ahead algorithm for the circular packing problem |
scientific article; zbMATH DE number 5805912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid beam search looking-ahead algorithm for the circular packing problem |
scientific article; zbMATH DE number 5805912 |
Statements
A hybrid beam search looking-ahead algorithm for the circular packing problem (English)
0 references
26 October 2010
0 references
minimum local-distance position
0 references
knapsack problems
0 references
0 references
0 references
0.903597891330719
0 references
0.8942402005195618
0 references
0.8597398400306702
0 references
0.8438358306884766
0 references
