English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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