  [libralesso_anytime_2020] proposed an anytime tree search algorithm for the
2018 ROADEF/EURO challenge glass cutting problem
(https://www.roadef.org/challenge/2018/en/index.php). The resulting program was
ranked first among 64 participants. In this article, we generalize it and show
that it is not only effective for the specific problem it was originally
designed for, but is also very competitive and even returns state-of-the-art
solutions on a large variety of Cutting and Packing problems from the
literature. We adapted the algorithm for two-dimensional Bin Packing, Multiple
Knapsack, and Strip Packing Problems, with two- or three-staged exact or
non-exact guillotine cuts, the orientation of the first cut being imposed or
not, and with or without item rotation. The combination of efficiency, ability
to provide good solutions fast, simplicity and versatility makes it
particularly suited for industrial applications, which require quickly
developing algorithms implementing several business-specific constraints. The
algorithm is implemented in a new software package called PackingSolver.
