An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Year of publication: |
2021
|
---|---|
Authors: | Libralesso, Luc ; Fontan, Florian |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 291.2021, 3 (16.6.), p. 883-893
|
Subject: | 2018 ROADEF/EURO challenge | Anytime tree search | Cutting & packing | Iterative Memory Bounded A* | Heuristik | Heuristics | Suchtheorie | Search theory | Operations Research | Operations research |
-
A tree search method for the container loading problem with shipment priority
Ren, Jidong, (2011)
-
Jooken, Jorik, (2023)
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
- More ...
-
Iterative beam search algorithms for the permutation flowshop
Libralesso, Luc, (2022)
-
Salem, Khadija Hadj, (2022)
- More ...