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

•Winner algorithm of the final phase of the 2018 ROADEF/EURO challenge.•New generic anytime tree search algorithm (Iterative Memory Bounded A*).•Combining heuristic guides, symmetry breaking, and pseudo-dominance rules.•Comprehensive study to assess components contribution.•Specialized dynamic progr...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 291; no. 3; pp. 883 - 893
Main Authors:	Libralesso, Luc, Fontan, Florian
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.06.2021
Subjects:	2018 ROADEF/EURO challenge Anytime tree search Cutting & packing Iterative Memory Bounded A Cutting & packing 2018 ROADEF/EURO challenge Anytime tree search Iterative Memory Bounded A
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!