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 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DOGS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3094979732 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2004.00963 / rank | |||
Normal rank | |||
Latest revision as of 01:10, 19 April 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
