A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728)
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 approach to solve the convex irregular bin packing problem with guillotine guts |
scientific article; zbMATH DE number 6877271
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A beam search approach to solve the convex irregular bin packing problem with guillotine guts |
scientific article; zbMATH DE number 6877271 |
Statements
A beam search approach to solve the convex irregular bin packing problem with guillotine guts (English)
0 references
31 May 2018
0 references
cutting
0 references
packing
0 references
heuristics
0 references
beam search
0 references
guillotine cuts
0 references
0 references
0 references
0 references
0 references
0 references
0.9130386
0 references
0.8841908
0 references
0.87787074
0 references
0.87203145
0 references
0.8673635
0 references
0.8654948
0 references
0.8653377
0 references
0.8645338
0 references
