Picture for Florian Fontan

Florian Fontan

An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems

Add code
Apr 20, 2020
Figure 1 for An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems
Figure 2 for An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems
Figure 3 for An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems
Figure 4 for An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems
Viaarxiv icon

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

Add code
Apr 02, 2020
Figure 1 for An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Figure 2 for An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Figure 3 for An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Figure 4 for An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Viaarxiv icon