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/

Zendy Plus

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

Zendy Tools

Zendy Open

During the loading phase of a vessel, only the containers that are on top oftheir stack are directly accessible. If the container that needs to be loadednext is not the top container, extra moves have to be performed, resulting inan increased loading time. One way to resolve this issue is via a procedurecalled premarshalling. The goal of premarshalling is to reshuffle thecontainers into a desired lay-out prior to the arrival of the vessel, in theminimum number of moves possible. This paper presents an exact algorithm basedon branch and bound, that is evaluated on a large set of instances. Thecomplexity of the premarshalling problem is also considered, and this papershows that the problem at hand is NP-hard, even in the natural case of stackswith fixed height.

A branch and price procedure for the container premarshalling problem