An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: DOGS / rank | |||
Normal rank |
Revision as of 03:26, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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