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

DOI10.1016/j.ejor.2020.10.050zbMath1487.90561arXiv2004.00963MaRDI QIDQ2030652

Luc Libralesso, Florian Fontan

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.00963

zbMATH Keywords

2018 ROADEF/EURO challenge; anytime tree search; cutting \& packing; Iterative Memory Bounded A*

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90B80: Discrete location and assignment

68W25: Approximation algorithms

Uses Software

• DOGS