An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652)
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: An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem |
scientific article |
Statements
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (English)
0 references
7 June 2021
0 references
anytime tree search
0 references
cutting \& packing
0 references
2018 ROADEF/EURO challenge
0 references
Iterative Memory Bounded A*
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7216740250587463
0 references
0.6820189356803894
0 references
0.6744782328605652
0 references
0.6593650579452515
0 references
